Storing the subdivision of a polyhedral surface

DOI10.1007/BF02187877zbMath0615.52008MaRDI QIDQ1820438

David M. Mount

Publication date: 1987

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131016

zbMATH Keywords

algorithmsubdivisiongeodesicincidence structurepolyhedral surfacequery processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Polytopes and polyhedra (52Bxx)

Related Items (5)

An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Shortest paths and convex hulls in 2D complexes with non-positive curvature ⋮ A survey of geodesic paths on 3D surfaces ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Tracing compressed curves in triangulated surfaces

Cites Work

• Fast detection of polyhedral intersection
• Computing convolutions by reciprocal search
• Finding the intersection of two convex polyhedra
• The Discrete Geodesic Problem
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Efficient uses of the past
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Optimal Point Location in a Monotone Subdivision
• On Shortest Paths in Polyhedral Spaces
• A New Approach to Planar Point Location
• A linear 5-coloring algorithm of planar graphs
• Optimal Search in Planar Subdivisions
• Location of a Point in a Planar Subdivision and Its Applications

This page was built for publication: Storing the subdivision of a polyhedral surface