Storing the subdivision of a polyhedral surface

DOI10.1007/BF02187877zbMATH Open0615.52008MaRDI QIDQ1820438FDOQ1820438

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1786508
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• scientific article; zbMATH DE number 2080267
• Parallel construction of subdivision hierarchies
• Point location in fat subdivisions

zbMATH Keywords

algorithmgeodesicpolyhedral surfacesubdivisionquery processingincidence structure

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• A survey of geodesic paths on 3D surfaces
• An optimal-time algorithm for shortest paths on realistic polyhedra
• Tracing compressed curves in triangulated surfaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local polyhedra and geometric graphs
• Free-Form Surface Partition in 3-D
• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• Title not available (Why is that?)
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Shortest paths and convex hulls in 2D complexes with non-positive curvature

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820438)