Proximate planar point location

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 220-226

  Iacono, John ^a   Langerman, Stefan ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Planar point location

Indexed keywords

ALGORITHMS; OPTIMIZATION; TREES (MATHEMATICS);

POINT LOCATIONS;

DATA STRUCTURES;

EID: 0038038272     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777825.777826     Document Type: Conference Paper

References (17)

1. S. Arya, S. Cheng, D. Mount, and H. Ramesh. Efficient expected-case algorithms for planar point location. In Scandanavian Workshop on Algorithm Theory. (LNCS 1851), pp. 353-366, 2000.
2. S. Arya, T. Malamatos, and D. M. Mount. Entropy-preserving cuttings and space-efficient planar point location. In Symposium on Discrete Algorithms, pp. 256-261, 2001.
3. S. Arya, T. Malamatos, and D. M. Mount. A simple emtropy-based algorithm for planar point location. In Symposium on Discrete Algorithms, pp. 262-268, 2001.
4. M. R. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput., 9:594-614, 1980.
5. R. Cole. On the dynamic ringer conjecture for splay trees. Part II: the proof. SIAM J. Computing, 30(1):44-85, 2000.
6. R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. Part I: splay sorting log n-block sequences. SIAM J. Computing, 30(1):1-43, 2000.
7. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
8. E. Demaine, J. Iacono, and S. Langerman. Proximate point searching. In Canadian Conference on Computational Geometry, pp. 1-4, 2002.
9. D. P. Dobkin and R. J. Lipton. Multidimensional searching problems. SIAM J. Comput., 5:181-186, 1976.
10. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Inform., 17:157-184, 1982.
11. J. Iacono. New upper bounds for pairing heaps. In Scandanavian Workshop on Algorithm Theory (LNCS 1851), pp. 32-45, 2000.
12. J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Symposium on Discrete Algorithms, pp. 516-522, 2001.
13. J. Iacono. Optimal planar point location. In Symposium on Discrete Algorithms, pp. 240-241, 2001.
14. D. E. Knuth. Optimum binary search trees. Acta Inf., 1:14-25, 1971.
15. D. Maier and S. C. Salveter. Hysterical B-trees. Inform. Process. Lett., 12:199-202, 1981.
16. N. Sarnak and R. E. Tarjan. Planar point location using persistant search trees. Comm. ACM, 29:669-679, 1986.
17. D. D. Sleator and R. E. Tarjan. Self-adjusting binary trees. JACM, 32:652-686, 1985.