Research and Algorithm of Constrained Delaunay Triangulation
Hai-Sheng Li
Abstract
Hai-Sheng Li
Abstract
The prerequisites for the legal existence of boundary edge and bound ary patch in Delaunay triangulation,which is put forward in reference [1],has been proved by exploiting the concept of Voronoi diagram and neighborhood in t hi s paper. The algorithm of constrained Delaunay triangulation is also designed an d implemented. The result further extends the theoretical basis of constrain ed D elaunay triangulation.
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.
The prerequisites for the legal existence of boundary edge and bound ary patch in Delaunay triangulation,which is put forward in reference [1],has been proved by exploiting the concept of Voronoi diagram and neighborhood in t hi s paper. The algorithm of constrained Delaunay triangulation is also designed an d implemented. The result further extends the theoretical basis of constrain ed D elaunay triangulation.
Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Voronoi diagram, Computer science, Surface triangulation, Point set triangulation