Abstract
A common structure arising in computational geometry is the subdivision of a plane defined by the faces of a straight-line planar graph. We consider a natural generalization of this structure on a polyhedral surface. The regions of the subdivision are bounded by geodesics on the surface of the polyhedron. A method is given for representing such a subdivision that is efficient both with respect to space and the time required to answer a number of different queries involving the subdivision. For example, given a pointx on the surface of the polyhedron, the region of the subdivision containingx can be determined in logarithmic time. Ifn denotes the number of edges in the polyhedron,m denotes the number of geodesics in the subdivision, andK denotes the number of intersections between edges and geodesics, then the space required by the data structure isO((n +m) log(n +m)), and the structure can be built inO(K + (n +m) log(n +m)) time. Combined with existing algorithms for computing Voronoi diagrams on the surface of polyhedra, this structure provides an efficient solution to the nearest-neighbor query problem on polyhedral surfaces.
Article PDF
Similar content being viewed by others
References
N. Chiba, T. Nishizeki, and N. Saito, A linear 5-coloring algorithm of planar graphs,J. Algorithms 2 (1981), 317–327.
D. Dobkin and D. Kirkpatrick, Fast detection of polyhedral intersections,Theoret. Comput. Sci. 27 (1983), 241–253.
D. P. Dobkin and J. I. Munro, Efficient uses of the past,J. Algorithms 6 (1985), 455–465.
H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a montone subdivision,SIAM J. Comput. 15 (1986), 317–340.
L. Guibas and R. Seidel, Computing convolutions by reciprocal search,Proceedings of the Second Annual ACM Symposium on Computational Geometry, 90–99, Yorktown Heights, New York, 1986.
L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,ACM Trans. Graphics 4 (1985), 74–123.
D. G. Kirkpatrick, Optimal search in planar subdivisions,SIAM J. Comput. 12 (1983), 28–35.
D. T. Lee and F. P. Preparata, Location of a point in a planar subdivision and its applications,SIAM J. Comput. 6 (1977), 595–606.
J. S. B. Mitchell, D. M. Mount, and C. G. Papdimitriou, The discrete geodesic problem,SIAM J. Comput., to appear.
D. M. Mount, On Finding Shortest Paths on Convex Polyhedra, Technical Report 1495, University of Maryland, 1985.
D. M. Mount, Voronoi Diagrams on the Surface of a Polyhedron, Technical Report 1496, University of Maryland, 1985.
D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Comput. Sci. 7 (1978), 217–236.
F. P. Preparata, A new approach to planar point location,SIAM J. Comput. 10 (1981), 473–482.
M. I. Shamos and D. Hoey, Closest-point problems,Proceedings of the 16th IEEE Foundations of Computer Science Symposium, 151–162, 1975.
M. Sharir, Intersection and closest-pair problems for a set of planar discs,SIAM J. Comput. 14 (1985), 448–468.
M. Sharir and A. Schorr, On shortest paths in polyhedral spaces,SIAM J. Comput. 15 (1986), 193–215.
Author information
Authors and Affiliations
Additional information
Communicated by David Dobkin
A preliminary version of this paper appeared at the Second Annual Symposium on Computational Geometry. The support of the Air Force Office of Scientific Research under Contract F-49620-85-K-0009 is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Mount, D.M. Storing the subdivision of a polyhedral surface. Discrete Comput Geom 2, 153–174 (1987). https://doi.org/10.1007/BF02187877
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187877