A conventional gift-wrapping algorithm for constructing the three-dimensional convex hull is revised into a numerically robust one. The proposed algorithm places the highest priority on the topological condition that the boundary of the convex hull should be isomorphic to a sphere, and uses numerical values as lower-prirority information for choosing one among the combinatorially consistent branches. No matter how poor the arithmetic precision may be, the algorithm carries out its task and gives as the output a topologically consistent approximation to the true convex hull. © 1994 Academic Press, Inc.
Sugihara, K. (1994). Robust gift wrapping for the three-dimensional convex hull. Journal of Computer and System Sciences, 49(2), 391–407. https://doi.org/10.1016/S0022-0000(05)80056-X