On the Exact Worst Case Query Complexity of Planar Point Location

Journal of Algorithms

Volumn 37, Issue 1, 2000, Pages 189-217

  Seidel, Raimund ^a   Adamy, Udo ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346109304     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1101     Document Type: Article

References (17)

1. U. Adamy, "Very Fast Planar Point Location?" Diplomarbeit, Univ. des Saarlandes, FB Informatik, 1998.
2. S. W. Cheng and R. Janardan, New results on dynamic planar point location, SIAM J. Comput. 21 (1992), 972-999.
3. R. Cole, Searching and storing similar lists, J. Algorithms 7 (1986), 202-220.
4. D. P. Dobkin and R. J. Lipton, Multidimensional search problems, SIAM J. Comput. 5 (1976), 181-186.
5. M. Edahiro, I. Kokubo, and Ta. Asano, A new point-location algorithm and its practical efficiency: comparison with existing algorithms, ACM Trans. Graph 3 (1984), 86-109.
6. H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986), 317-340.
7. M. T. Goodrich, M. Orletsky, and K. Ramaiyer, Methods for achieving fast query times in point location data structures, in "Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 757-766, 1997.
8. D. G. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput. 12 (1983), 28-35.
9. D. G. Kirkpatrick and M. Klawe, Alphabetic minimax trees, SIAM J. Comput. 14 (1985), 514-526.
10. S. R. Kosaraju, Parallel evaluation of division-free arithmetic expressions, in "Proc. 18th ACM Symp. on Theory of Comp. (STOC)," pp. 231-239, 1986.
11. D. T. Lee and F. P. Preparata, Location of a point in a planar subdivision and its applications, SIAM J. Comput. 6 (1977), 594-606.
12. R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980), 615-627.
13. K. Mehlhorn, "Sorting and Searching," Data Structures and Algorithms, Vol. 1, Springer-Verlag, Heidelberg, 1984.
14. K. Mulmuley, A fast planar partition algorithm, I, in "Proc. 29th Annual IEEE Sympos. Found. Comput. Sci.," pp. 580-589, 1988.
15. F. P. Preparata, A new approach to planar point location, SIAM J. Comput. 10 (1981), 473-482.
16. N. Sarnak and R. E. Tarjan, Planar point location using persistent search trees, Comm. Assoc. Comput. Mach. 29 (1986), 669-679.
17. R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Comput. Geo. Theory Appl. 1 (1991), 51-64.