From 0c8183c38fbfd9954d7f8e2844b03d4ad51e4eab Mon Sep 17 00:00:00 2001 From: Laurent Rineau Date: Mon, 16 Jun 2025 17:19:42 +0200 Subject: [PATCH] explain why Hang Si articles are used --- .../Constrained_triangulation_3.txt | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt index 268cc1d3fbc..bf6b01f298e 100644 --- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt +++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt @@ -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