A Lawson-like Algorithm for the Triangulation of Points in Three-Dimensions
A Thesis Presented for the Master of Science in Computational Engineering Degree, University of Tennessee at Chattanooga
Christopher Bruce Hilbert, April 2009
This work presents the motivations for and results from an extension of Lawson’s algorithm to a set of three-dimensional points intended to form a surface. An explication of the algorithm sufficient for implementation is included. Also, many examples of meshes are provided which demonstrate the utility of this algorithm including triangulations of the topology near Chattanooga, TN.