Minimum vertex hulls for polyhedral domains

DOI10.1016/0304-3975(92)90088-WzbMATH Open0753.68091OpenAlexW1569214028MaRDI QIDQ1199529FDOQ1199529

Gautam K. Das, Deborah Joseph

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

Recommendations

• scientific article
• An approximate algorithm for the minimal vertex nested polygon problem
• scientific article; zbMATH DE number 742976
• An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
• Covering Polygons Is Hard

zbMATH Keywords

object approximations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Planar Formulae and Their Uses
• 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
• An optimal algorithm for computing a minimum nested nonconvex polygon
• Title not available (Why is that?)

Cited In (5)

• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• Separation and approximation of polyhedral objects
• On the complexity of approximating and illuminating three-dimensional convex polyhedra
• On surface-minimizing polyhedral decompositions
• Minimum degree triangulation for rectangular domains

This page was built for publication: Minimum vertex hulls for polyhedral domains

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