Hausdorff approximation of 3D convex polytopes
From MaRDI portal
(Redirected from Publication:963404)
Cites work
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- scientific article; zbMATH DE number 480235 (Why is no real title available?)
- scientific article; zbMATH DE number 665688 (Why is no real title available?)
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- Algorithms for polytope covering and approximation
- Almost optimal set covers in finite VC-dimension
- Computational Geometry in C
- Constructing a polytope to approximate a convex body
- Convex hulls of finite sets of points in two and three dimensions
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Dropping a vertex or a facet from a convex polytope
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Hausdorff approximation of convex polygons
- Linear time approximation of 3D convex polytopes
- Metric entropy of some classes of sets with differentiable boundaries
- On the Delone triangulation numbers
- Optimal Search in Planar Subdivisions
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- The approximation of convex sets by polyhedra
- Umbrellas and polytopal approximation of the Euclidean ball
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)