Linear time approximation of 3D convex polytopes
From MaRDI portal
Publication:1862132
DOI10.1016/S0925-7721(02)00100-1zbMath1015.52013OpenAlexW2072503362MaRDI QIDQ1862132
Mario A. Lopez, Shlomo Reisner
Publication date: 10 March 2003
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00100-1
Related Items (4)
On feasible sets for MPC and their approximations ⋮ Hausdorff approximation of 3D convex polytopes ⋮ Approximation of convex sets by polytopes ⋮ Hausdorff approximation of convex polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Constructing a polytope to approximate a convex body
- Almost optimal set covers in finite VC-dimension
- Optimal triangulation and quadric-based surface simplification
- Lagerung von Punkten auf der Kugel
- Dropping a vertex or a facet from a convex polytope
- Optimal Search in Planar Subdivisions
- Convex hulls of finite sets of points in two and three dimensions
- Computational Geometry in C
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- Algorithms for polytope covering and approximation
This page was built for publication: Linear time approximation of 3D convex polytopes
