Removing Points from a Delaunay Tetrahedralization

Authors

Nathan Moon, Brigham Young University
Dr. Bryan S. Morse, Brigham Young University

Keywords

Delaunay tetrahedralization, non-intersecting tetrahedra, quantization algorithm

College

Physical and Mathematical Sciences

Department

Computer Science

Abstract

A set of points in three dimensions can be tetrahedralized, or broken into non-intersecting tetrahedra, in many ways. A Delaunay tetrahedralization of a set of points is a tetrahedralization with the property that the sphere defined by each tetrahedron in the structure does not contain any other points in the structure besides the points defining the tetrahedron. A Delaunay tetrahedralization of a set of points is unique except for the case where more than four points are co-spherical.

Recommended Citation

Moon, Nathan and Morse, Dr. Bryan S. (2013) "Removing Points from a Delaunay Tetrahedralization," Journal of Undergraduate Research: Vol. 2013: Iss. 1, Article 2661.
Available at: https://scholarsarchive.byu.edu/jur/vol2013/iss1/2661