作者: Reinhard Klein
DOI: 10.1007/978-3-642-60718-9_22
关键词: Chew's second algorithm 、 Algorithm 、 Constrained Delaunay triangulation 、 Pitteway triangulation 、 Computer science 、 Polygon triangulation 、 Surface triangulation 、 Bowyer–Watson algorithm 、 Delaunay triangulation 、 Minimum-weight triangulation
摘要: A fast and easy to implement divide-and-conquer algorithm is presented for the construction of Constrained Delaunay triangulation a polygonal domain. The simplifies complicated merging step inherent algorithms computation triangulations. Furthermore, no triangles are computed outside valid region grid structure accelerates visibility among vertices with respect boundary polygons as well triangles.