A simple algorithm for building the 3-D convex hull

DOI10.1007/BF02218436zbMath0561.65046OpenAlexW2065156622MaRDI QIDQ2266570

Chr. Gram, Gunner Helweg Johansen

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02218436

zbMATH Keywords

stepwise refinementconvex hullcomplexity boundsminimum convex polyhedron

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex sets in (3) dimensions (including convex surfaces) (52A15) Computer aspects of numerical algorithms (65Yxx)

Cites Work

• Unnamed Item
• Divide and conquer for linear expected time
• 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
• An Algorithm for Convex Polytopes

This page was built for publication: A simple algorithm for building the 3-D convex hull