Robust gift wrapping for the three-dimensional convex hull
From MaRDI portal
Publication:1337472
DOI10.1016/S0022-0000(05)80056-XzbMATH Open0809.65149MaRDI QIDQ1337472FDOQ1337472
Publication date: 26 March 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient algorithm for determining the convex hull of a finite planar set
- A New Convex Hull Algorithm for Planar Sets
- An Algorithm for Convex Polytopes
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Two design principles of geometric algorithms in finite-precision arithmetic
- On the identification of the convex hull of a finite set of points in the plane
- Convex hulls of finite sets of points in two and three dimensions
- Finding the convex hull facet by facet
- A paradigm for robust geometric algorithms
- Problems, problems, problems
Cited In (7)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- Title not available (Why is that?)
- A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D
- An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves
- Towards exact geometric computation
- Convex hull of a planar set of straight and circular line segments
- Three-dimensional convex hull as a fruitful source of diagrams
This page was built for publication: Robust gift wrapping for the three-dimensional convex hull
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337472)
