|
|
Journal Papers
- S. Arya, T. Malamatos and D. M. Mount, Space-time
tradeoffs for approximate nearest neighbor searching, Journal
of the ACM, 57(1):1-54,
2009.
- S. Arya, T. Malamatos and D. M. Mount, The effect
of corners on the complexity of approximate range searching, Discrete
and Computational
Geometry, 41(3):398-443, 2009.
- T. Malamatos, Lower
bounds for expected-case planar point location,
Computational
Geometry: Theory and Applications, 39:91-103, 2008.
- S. Arya, T. Malamatos, D. M. Mount and C. K. Wong, Optimal
expected-case planar point location, SIAM Journal
on Computing,
37(2):584-610, 2007.
- S. Arya, T. Malamatos and D. M. Mount, A simple
entropy-based
algorithm for planar point
location, ACM Transactions on Algorithms,
3(2) Article
No. 17, 2007.
- S. Funke, T. Malamatos and R. Ray, Finding
planar
regions in a
terrain: in practice and with a guarantee, International
Journal on
Computational Geometry and Applications (special issue of
invited
papers from SCG'04), 15(4):379-401,
2005.
Conference Papers
- I. Z. Emiris, T. Malamatos and E. Tsigaridas, Approximate nearest neighbor
queries
among parallel segments, in Proc.
26th European Workshop on
Computational Geometry (EuroCG), 141-144, 2010.
- S. Funke, T. Malamatos, D. Matijevic and N. Wolpert, (Approximate)
Conic nearest neighbors and
the induced Voronoi diagram,
in Proc. 18th Canadian
Conference on
Computational Geometry (CCCG), 23-26, 2006.
- S. Arya, T. Malamatos and D. M. Mount, The effect
of corners on the complexity of approximate range searching,
in Proc.
22th ACM Symp. on Computational Geometry (SCG),
11-20, 2006.
- S. Arya, T. Malamatos and
D. M. Mount, On
the importance of idempotence,
in Proc. 38th ACM Symp. on Theory of
Computing (STOC), 564-573, 2006.
- S. Arya, T. Malamatos and D. M. Mount, On the importance of
idempotence,
in Proc. 15th Fall Workshop on Computational Geometry and
Visualization (FWCG), 75-76, 2006. (short version)
- T. Malamatos, Lower bounds for
expected-case
planar point location,
in Proc. 17th Canadian
Conference on
Computational Geometry (CCCG), 200-203, 2005.
- S. Arya, T. Malamatos and D. M. Mount, Space-time
tradeoffs for approximate spherical range counting, in Proc.
16th ACM-SIAM Symp. on Discrete Algorithms
(SODA), 535-544, 2005.
- S. Funke, T. Malamatos and R. Ray, Finding planar
regions in a
terrain: in practice and with a guarantee, in Proc. 20th ACM Symp. on
Computational
Geometry (SCG), 96-105, 2004.
- S. Funke, T. Malamatos and R. Ray, Finding planar regions
in a terrain,
in Proc. 20th European
Workshop on
Computational Geometry (EuroCG), 2004. (short version)
- S. Arya, T. Malamatos and D. M. Mount, Space-efficient
approximate Voronoi diagrams,
in Proc. 34th ACM Symp. on Theory of
Computing (STOC), 721-730, 2002.
- S. Arya and T. Malamatos, Linear-size
approximate Voronoi diagrams, in Proc. 13th
ACM-SIAM Symp. on
Discrete Algorithms (SODA), 147-155, 2002.
- S. Arya, T. Malamatos and D. M. Mount, A simple
entropy-based
algorithm for planar point
location, in Proc. 12th ACM-SIAM Symp. on Discrete
Algorithms
(SODA), 262-268, 2001.
- S. Arya, T. Malamatos and D. M. Mount, Entropy-preserving
cuttings and space-efficient
planar point location, in Proc. 12th ACM-SIAM Symp.
on
Discrete Algorithms (SODA), 256-261, 2001.
- S. Arya, T. Malamatos, and D. M. Mount, Nearly
optimal
expected-case planar point location, in Proc. 41th
IEEE
Symp. on Foundations of Computer Science (FOCS), 208-218,
2000.
Thesis
|