File tree Expand file tree Collapse file tree
Constrained_triangulation_3/doc/Constrained_triangulation_3 Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -95,7 +95,9 @@ version of the original PLC that admits a constrained Delaunay triangulation. Th
9595achieved by adding Steiner vertices to the input edges and polygons. The constrained triangulation
9696built on this refined PLC is known as a _conforming constrained Delaunay triangulation_ (CCDT for short).
9797
98- The algorithm implemented in this package is based on the work of Hang Si
98+ The algorithm implemented in this package is based on the work of Hang Si, who developed particular
99+ algorithms for constructing conforming constrained Delaunay triangulations from PLCs, with floating
100+ point numbers as coordinates
99101\cgalCite{si2005meshing}, \cgalCite{cgal:si2008cdt3}, \cgalCite{si2015tetgen}.
100102
101103\cgalFigureRef{CT_3_plc2cdt_fig} illustrates an example of a conforming constrained
You can’t perform that action at this time.
0 commit comments