songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

explain why Hang Si articles are used

This commit is contained in:
Laurent Rineau 2025-06-16 17:19:42 +02:00
parent 2be776e74f
commit 0c8183c38f
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -95,7 +95,9 @@ version of the original PLC that admits a constrained Delaunay triangulation. Th
achieved by adding Steiner vertices to the input edges and polygons. The constrained triangulation
built on this refined PLC is known as a _conforming constrained Delaunay triangulation_ (CCDT for short).
The algorithm implemented in this package is based on the work of Hang Si
The algorithm implemented in this package is based on the work of Hang Si, who developed particular
algorithms for constructing conforming constrained Delaunay triangulations from PLCs, with floating
point numbers as coordinates
\cgalCite{si2005meshing}, \cgalCite{cgal:si2008cdt3}, \cgalCite{si2015tetgen}.
\cgalFigureRef{CT_3_plc2cdt_fig} illustrates an example of a conforming constrained