Discrete & Computational Geometry

, Volume 2, Issue 2, pp 153–174 | Cite as

Storing the subdivision of a polyhedral surface

  • David M. Mount
Article

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.

Keywords

Planar Graph Voronoi Diagram Query Point Incidence Structure Conflict Graph 

References

  1. 1.
    N. Chiba, T. Nishizeki, and N. Saito, A linear 5-coloring algorithm of planar graphs,J. Algorithms 2 (1981), 317–327.MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    D. Dobkin and D. Kirkpatrick, Fast detection of polyhedral intersections,Theoret. Comput. Sci. 27 (1983), 241–253.MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    D. P. Dobkin and J. I. Munro, Efficient uses of the past,J. Algorithms 6 (1985), 455–465.MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a montone subdivision,SIAM J. Comput. 15 (1986), 317–340.MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.MATHCrossRefGoogle Scholar
  7. 7.
    D. G. Kirkpatrick, Optimal search in planar subdivisions,SIAM J. Comput. 12 (1983), 28–35.MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    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.MathSciNetGoogle Scholar
  9. 9.
    J. S. B. Mitchell, D. M. Mount, and C. G. Papdimitriou, The discrete geodesic problem,SIAM J. Comput., to appear.Google Scholar
  10. 10.
    D. M. Mount, On Finding Shortest Paths on Convex Polyhedra, Technical Report 1495, University of Maryland, 1985.Google Scholar
  11. 11.
    D. M. Mount, Voronoi Diagrams on the Surface of a Polyhedron, Technical Report 1496, University of Maryland, 1985.Google Scholar
  12. 12.
    D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Comput. Sci. 7 (1978), 217–236.MATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    F. P. Preparata, A new approach to planar point location,SIAM J. Comput. 10 (1981), 473–482.MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    M. I. Shamos and D. Hoey, Closest-point problems,Proceedings of the 16th IEEE Foundations of Computer Science Symposium, 151–162, 1975.Google Scholar
  15. 15.
    M. Sharir, Intersection and closest-pair problems for a set of planar discs,SIAM J. Comput. 14 (1985), 448–468.MATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    M. Sharir and A. Schorr, On shortest paths in polyhedral spaces,SIAM J. Comput. 15 (1986), 193–215.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1987

Authors and Affiliations

  • David M. Mount
    • 1
  1. 1.Department of Computer Science and Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations