作者: Charles L. Lawson
DOI: 10.1016/0167-8396(86)90001-4
关键词: Tessellation 、 Constrained Delaunay triangulation 、 Combinatorics 、 Pitteway triangulation 、 Convex hull 、 Point set triangulation 、 Minimum-weight triangulation 、 Mathematics 、 Delaunay triangulation 、 Triangulation
摘要: Abstract This paper establishes a number of mathematical results relevant to the problem constructing triangulation, i.e., simplical tessellation convex hull an arbitrary finite set points in n-space. The principal present are 1. (a) A n + 2 n-space may be triangulated at most different ways. 2. (b) ‘sphere test’ defined this selects preferred one these two triangulations. 3. (c) parameters is that permits characterization and enumeration all sets significantly from point view their possible 4. (d) local sphere test induces global property for triangulation. 5. (e) triangulation satisfying dual n-dimensional Dirichlet tessellation, it Delaunay