Robust gift wrapping for the three-dimensional convex hull

DOI10.1016/S0022-0000(05)80056-XzbMath0809.65149MaRDI QIDQ1337472

Kōkichi Sugihara

Publication date: 26 March 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

polyhedraplanar graphsconvex hullfinite precision arithmeticSteinitz's theoremrobust gift wrapping

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Related Items (6)

An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) ⋮ Three-dimensional convex hull as a fruitful source of diagrams ⋮ Towards exact geometric computation ⋮ A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D ⋮ Convex hull of a planar set of straight and circular line segments ⋮ An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two design principles of geometric algorithms in finite-precision arithmetic
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Problems, problems, problems
• A paradigm for robust geometric algorithms
• An efficient algorithm for determining the convex hull of a finite planar set
• On the identification of the convex hull of a finite set of points in the plane
• Finding the convex hull facet by facet
• Convex hulls of finite sets of points in two and three dimensions
• A New Convex Hull Algorithm for Planar Sets
• An Algorithm for Convex Polytopes

This page was built for publication: Robust gift wrapping for the three-dimensional convex hull