Abstract
A new algorithm is given for finding the convex hull of a finite set of distinct points in three-dimensional space. The algorithm finds the faces of the hull one by one, thus gradually building the polyhedron that constitutes the hull. The algorithm is described as developed through stepwise refinement.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have