This Article 
 Bibliographic References 
 Add to: 
Tetrahedralization of Point Sets Using Expanding Spheres
January/February 2005 (vol. 11 no. 1)
pp. 102-109
The expanding sphere algorithm computes an alpha shape tetrahedralization of a point set. Starting with a seed tetrahedron, the circumscribing sphere is squeezed through each face until it either touches another point or exceeds a preset radius. If no point is found, that face of the tetrahedron is part of the surface of an object. If a point is found, a new tetrahedron is constructed. This process is iterated until all the faces of the tetrahedra have been processed and no more connected points can be found. If there are points left over, the process is iterated, creating additional objects. The algorithm generates a list of objects, with an alpha shape tetrahedralization and a surface triangulation for each. Any points that cannot be made part of a valid tetrahedron are also returned in the extra points list. The algorithm is efficient for uniformly distributed point sets, with a running time that is linear in the number of points for such sets. Since the operations are local, it is also robust.

[1] P. Cignoni, C. Montani, and R. Scopigno, “DeWall: A Fast Divide and Conquer Delaunay Triangulation Algorithm in Ed,” Consiglio Nazionale delle Ricerche, dewall.pdf, 1997. Software available from: http://vcg.isti. .
[2] F. Aurenhammer, “Voronoi Diagrams— A Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, Sept. 1991.
[3] H. Edelsbrunner and E.P. Mücke, “Three Dimensional Alpha Shapes,” ACM Trans. Graphics, vol. 13, no. 1, pp. 43-72, Jan. 1994.
[4] S.I. Nin, J.M. Kasson, and W.E. Plouffe, “Printing CIELAB Images on a CMYK Printer Using Trilinear Interpolation,” Color Hard-copy and Graphics Arts, Proc. SPIE, vol. 1670, pp. 316-324, 1992.
[5] H. Boll, “Color to Colorant Transformation for a Seven Ink Process,” Device Independent Color Imaging, Proc. SPIE, vol. 2170, pp. 108-119, 1994.
[6] T.P. Fang and L.A. Piegl, “Delaunay Triangulation in Three Dimensions,” IEEE Computer Graphics and Applications, vol. 15, no. 5, pp. 62-69, Sept. 1995.
[7] H. Edelsbrunner and E.P. Mücke, “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms,” ACM Trans. Graphics, vol. 9, no. 1, pp. 66-104, 1990.
[8] I. Beichl, “Dealing with Degeneracy in Triangulation,” IEEE Computing in Science and Engineering, pp. 70-73, Nov./Dec. 2002.
[9] F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva, and G. Taubin, “The Ball-Pivoting Algorithm for Surface Reconstruction,” IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 4, pp. 349-359, Oct./Dec. 1999.
[10] S. Owen, “Meshing Research Corner,” Sandia, see overview link at: , 2004.
[11] F.P. Preparata and M.I. Shamos, Computational Geometry, pp. 131-137. New York: Springer-Verlag, 1985.
[12] H. Edelsbrunner, “Surface Reconstructions by Wrapping Finite Sets in Space,” Dept. of Computer Science, Duke Univ., Durham N.C., , 2001.
[13] CGAL software downloaded from http:/, 2004.
[14] A. Fabri, “Computational Geometry Algorithms Library,” personal comm., 2004.

Index Terms:
Boundary representations, constructive solid geometry, surface reconstruction, shape reconstruction.
Martin S. Maltz, "Tetrahedralization of Point Sets Using Expanding Spheres," IEEE Transactions on Visualization and Computer Graphics, vol. 11, no. 1, pp. 102-109, Jan.-Feb. 2005, doi:10.1109/TVCG.2005.16
Usage of this product signifies your acceptance of the Terms of Use.