Minimum vertex hulls for polyhedral domains

DOI10.1016/0304-3975(92)90088-WzbMath0753.68091OpenAlexW1569214028MaRDI QIDQ1199529

Deborah Joseph, Gautam K. Das

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90088-w

zbMATH Keywords

object approximations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

On the complexity of approximating and illuminating three-dimensional convex polyhedra ⋮ Separation and approximation of polyhedral objects ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm for computing a minimum nested nonconvex polygon
• Finding the smallest triangles containing a given convex polygon
• Triangulating Simple Polygons and Equivalent Problems
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Planar Formulae and Their Uses