Two-dimensional and three-dimensional point location in rectangular subdivisions

Journal of Algorithms

Volumn 18, Issue 2, 1995, Pages 256-277

  DeBerg, Mark ^a   Van Kreveld, Mark ^a   Snoeyink, Jack ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (22)

1. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Naher, S. Schirra, and C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, in "Proceedings, 6th Annual ACM Symposium on Computational Geometry, " pp. 281-289, 1990.
2. B. Chazelle, Filtering search: A new approach to query-answering, SIAM J. Comput. 15, No. 3 (1986), 703-723.
3. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, Dynamic perfect hashing: Upper and lower bounds, in "Proceedings 29th FOCS, " pp. 524-531, 1988; revised version, Bericht No. 77, Reihe Informatik, Paderborn, January, 91.
4. H. Edelsbrunner, "Algorithms in Combinatorial Geometry, " Springer-Verlag, Berlin, 1987.
5. H. Edelsbrunner, G. Haring, and D. Hilbert, Rectangular point location in d dimensions with applications, Comput. J. 29 (1986), 76-82.
6. H. Edelsbrunner and H. A. Maurer, A space-optimal solution of general region location, Theoret. Comput. Sci. 16 (1981), 329-336.
7. M. L. Fredman, J. Komlos, and E. Szemeredi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mech. 31, No. 3 (1984), 538-544.
8. M. T. Goodrich, Planar separators and parallel polygon triangulation, in "Proceedings, 24th Annual ACM STOC, " pp. 507-516, 1992.
9. M. T. Goodrich and R. Tamassia, Dynamic trees and dynamic point location, in "Proceedings, 23rd Annual ACM STOC, " pp. 523-533, 1991.
10. D. Johnson, A priority queue in which initialization and queue operations take O(loglog D) time, Math. Systems Theory 15 (1982), 295-309.
11. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geometry 1 (1986), 59-71.
12. R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, in "Proceedings, iSth FOCS, " pp. 162-170, 1977.
13. J. Matousek, N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes, in "Proceedings, J2nd FOCS, " pp. 49-58, 1991.
14. K. Mehlhorn and S. Naher, Bounded ordered dictionaries in Odoglog AO time and O(n) space, Inform. Process. Lett. 35 (1990), 183-189.
15. H. Muller, Rasterized point location, in "Proceedings, WG 85" (H. Noltemeier, Ed.), pp. 281-294, Trauner Verlag, 1985.
16. F. P. Preparata, Planar point location revisited, Int. J. Foundations Comput. Sci., 1, No. 1 (1990), 71-86.
17. F. P. Preparata, J. S. Vitter, and M. Yvinec, Computation of the axial view of a set of isothetic parallelepipeds, ACM Trans. Graphics 9 (1990), 278-300.
18. F. P. Preparata, J. S. Vitter, and M. Yvinec, Output-sensitive generation of the perspective view of isothetic parallelepipeds, Algorithmica 8 (1992), 257-283.
19. P. van Emde Boas, Preserving order in a forest in less than logarithmic time, in "Proceedings, 16th FOCS, " pp. 75-84, 1976.
20. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6 (1977), 80-82.
21. P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977), 99-127.
22. D. E. Willard, Log-logarithmic worst-case range queries are possible in space Θ(N), Inform. Process. Lett. 17 (1983), 81-89.