An algorithm to build convex hulls for 3?D objects
Journal
Journal of the Chinese Institute of Engineers
Journal Volume
29
Journal Issue
6
Pages
945-952
Date Issued
2006
Author(s)
Abstract
In this paper, a new algorithm based on the Quickhull algorithm is proposed to find convex hulls for 3-D objects using neighbor trees. The neighbor tree is the data structure by which all visible facets to the selected furthest outer point can be found. The neighboring sequence of ridges on the outer boundary of all visible facets also can be found directly from the neighbor tree. This new algorithm is twice as efficient as Barber’s algorithm. Key Words: 3-D convex hull, quickhull algorithm, computational geometry. I.
SDGs
Type
journal article