Abstract
This paper considers the problem of locating a point in a polyhedral subdivision of the space defined by planar polygonal faces. A persistent form of binary-binary search tree is presented so that the point location problem can be solved in O(log N) query time and O(N+K) space, where N is the total number of edges and K the edge intersections in the image plane. The persistent structure also gives new better solutions for many other geometric problems.
Preview
Unable to display preview. Download preview PDF.
References
J.L. Bentley and D. Wood, An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Trans. on Comput. C-29(1980), 571–577.
B. Chazelle, How to search in history, Inform. Control 64(1985), 77–99.
B.Chazelle and H.Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, in Proceedings, 29th Annu. IEEE Symp. Found. of Comput. Sci.(1988), pp. 590–600.
B.Chazelle and J.Friedman, A deterministic view of random sampling and its use in geometry, in Proceedings, 29th Annu. IEEE Symp. Found. of Comput. Sci.(1988), pp. 539–548.
K.L. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geometry 2(1987), 195–222.
R. Cole, Searching and storing similar lists, J. Algorithms 7(1986), 202–220.
P.Dietz and D.D.Sleator, Two algorithms for maintaining order in a list, in Proceedings, 19th Annu. ACM Symp. Theory of Computing(1987), pp. 365–372.
D. Dobkin and R.J. Lipton, Multidimensional search problems, SIAM J. Comput. 5(1976), 181–186.
J.R. Driscoll, N. Sarnak, D.D. Sleator and R.T. Tarjan, Making data structures persistent, J. Comput. Sys. Sci. 38(1989), 86–124.
H.Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
H. Edelsbrunner, H.A. Maurer and D.G. Kirkpatrick, Polygonal intersection searching, Inform. Process. Lett. 14(1982), 74–77.
H. Edelsbrunner, M.H. Overmars and R. Seidel, Some methods of computational geometry applied to computer graphics, Comput. Vision Graphics Image Process. 28(1984), 92–108.
L.J.Guibas and R.Sedgewick, A dichromatic framework for balanced trees, in Proceedings, 19th Annu. IEEE Symp. Found. of Comput. Sci.(1978), pp. 8–21.
M. McKenna, Worst case optimal hidden surface removal, ACM Trans. Graphics 6, 1987, 19–28.
J. Nivergelt and F.P. Preparata, Plane sweep algorithms for intersecting geometric figures, Comm. ACM 25(1982), 739–747.
O. Nurmi, A fast line-sweep algorithm for hidden line elimination, BIT 25(1985), 466–472.
O. Nurmi, On translating a set of objects in 2-and 3-dimensional space, Comput. Vision Graphics Image Process. 36(1986), 42–52.
F.P.Preparata and M.I.Shamos, Computational Geometry, Springer-Verlag, 1985.
F.P.Preparata and R.Tamassia, Fully dynamic techniques for point location and transitive closure in planar structures, in Proceedings, 29th Annu. IEEE Symp. Found. of Comput. Sci.(1988), pp. 558–567.
F.P. Preparata and R. Tamassia, Fully dynamic point location in a monotone subdivision, SIAM J. Comput. 18(1989), 811–830.
F.P. Preparata and R. Tamassia, Efficient spatial point location, in Algorithms and Data Structures (WADS'89), Lect. Notes in Comput. Sci. 382, Springer-Verlag, 1989, pp. 3–11.
N. Sarnak and R.E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29(1986), 669–679.
A.Schmitt, H.Müller and W.Leister, Ray tracing algorithms — theory and practice, Proc. NATO Advanced Study Inst. Theoret. Found. Comput. Graphics and CAD, Springer-Verlag, 1987, pp. 997–1029.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, XH., Hirata, T., Inagaki, Y. (1990). Spatial point location and its applications. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_73
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive