Jian Xian-hua
Abstract
An algorithm for constructing Delaunay triangulation of arbitrarily shaped planar domains is presented.The algorithm has the properties that only a few new points are created in local area, and only the triangulation in local area is needed to make the global triangulation matching with the Delaunay feature.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An algorithm for constructing Delaunay triangulation of arbitrarily shaped planar domains is presented.The algorithm has the properties that only a few new points are created in local area, and only the triangulation in local area is needed to make the global triangulation matching with the Delaunay feature.
Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Surface triangulation, Point set triangulation, Minimum-weight triangulation, Triangulation