Convex Hulls in a 3-Dimensional Space

This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new data structure, the cell list, suggested by one of the authors. The correctness of the algorithm is proved and experimental results are presented.

• Type: Conference
• Year: 2004
• Where: IWCIA
• Authors: Vladimir Kovalevsky, Henrik Schulz
• Keywords: 3-dimensional Object, Algorithm Stract Polyhedron, Convex Hull, IWCIA 2004