Proximate point searching

Computational Geometry: Theory and Applications

Volumn 28, Issue 1, 2004, Pages 29-40

  Demaine, Erik D ^a   Iacono, John ^b   Langerman, Stefan ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Distance functions; Dynamic finger property; Point location

Indexed keywords

EID: 84867947633     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.01.005     Document Type: Conference Paper

References (18)

1. M.R. Brown, and R.E. Tarjan Design and analysis of a data structure for representing sorted lists SIAM J. Comput. 9 1980 594 614
2. D.D. Sleator, and R.E. Tarjan Self-adjusting binary trees J. ACM 32 1985 652 686
3. R. Cole, B. Mishra, J. Schmidt, and A. Siegel On the dynamic finger conjecture for splay trees. Part I: splay sorting logn-block sequences SIAM J. Comput. 30 1 2000 1 43
4. R. Cole On the dynamic finger conjecture for splay trees. Part II: the proof SIAM J. Comput. 30 1 2000 44 85
5. J. Iacono Alternatives to splay trees with O(logn) worst-case access times Proc. 12th ACM-SIAM Sympos. Discrete Algorithms 2001 516 522
6. J. Iacono New upper bounds for pairing heaps Proc. 7th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. vol. 1851 2000 32 45
7. M.L. Fredman, R. Sedgewick, D.D. Sleator, and R.E. Tarjan The pairing heap: a new form of self-adjusting heap Algorithmica 1 1986 111 129
8. S. Arya, T. Malamatos, and D.M. Mount Entropy-preserving cuttings and space-efficient planar point location Proc. 12th ACM-SIAM Sympos. Discrete Algorithms 2001 256 261
9. S. Arya, T. Malamatos, and D.M. Mount A simple entropy-based algorithm for planar point location Proc. 12th ACM-SIAM Sympos. Discrete Algorithms 2001 262 268
10. J. Iacono Optimal planar point location Proc. 12th ACM-SIAM Sympos. Discrete Algorithms 2001 240 241
11. D.E. Knuth Optimum binary search trees Acta Inf. 1 1971 14 25
12. M.T. Goodrich, M. Orletsky, and K. Ramaiyer Methods for achieving fast query times in point location data structures Proc. 8th ACM-SIAM Sympos. Discrete Algorithms 1997 757 766
13. R. Motwani, and P. Raghavan Randomized Algorithms 1995 Cambridge Univ. Press Cambridge
14. W. Pugh Skip lists: a probabilistic alternative to balanced trees F. Dehne, J.-R. Sack, N. Santoro, Proceedings of the Workshop on Algorithms and Data Structures, Ottawa, Ontario, Canada, Lecture Notes in Comput. Sci. vol. 382 1989 437 449
15. J.I. Munro, T. Papadakis, and R. Sedgewick Deterministic skip lists Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, Orlando, Florida 1992 367 375
16. H. Edelsbrunner Algorithms in combinatorial geometry EATCS Monographs on Theoretical Computer Science vol. 10 1987 Springer-Verlag Heidelberg, West Germany
17. J. Iacono, and S. Langerman Proximate point location Proceedings of the 2003 ACM Symposium on Computational Geometry (SoCG 2003) 2003 220 226
18. S. Arya, and D.M. Mount Approximate nearest neighbor queries in fixed dimensions Proc. 4th ACM-SIAM Sympos. Discrete Algorithms 1993 271 280