Hausdorff approximation of 3D convex polytopes
From MaRDI portal
Publication:963404
DOI10.1016/J.IPL.2008.01.010zbMATH Open1186.68563OpenAlexW2018604794MaRDI QIDQ963404FDOQ963404
Authors: Mario A. Lopez, Shlomo Reisner 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.010
Cites Work
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Almost optimal set covers in finite VC-dimension
- Optimal Search in Planar Subdivisions
- Computational Geometry in C
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for polytope covering and approximation
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Convex hulls of finite sets of points in two and three dimensions
- Title not available (Why is that?)
- The approximation of convex sets by polyhedra
- Dropping a vertex or a facet from a convex polytope
- Metric entropy of some classes of sets with differentiable boundaries
- Umbrellas and polytopal approximation of the Euclidean ball
- Constructing a polytope to approximate a convex body
- Linear time approximation of 3D convex polytopes
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Hausdorff approximation of convex polygons
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- On the Delone triangulation numbers
This page was built for publication: Hausdorff approximation of 3D convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963404)
