From 31fd8d259cca0fbefefbf9b3256f75defbeb7257 Mon Sep 17 00:00:00 2001 From: Laurent Rineau Date: Thu, 3 Apr 2025 16:12:54 +0200 Subject: [PATCH] Implementation History --- .../Constrained_triangulation_3.txt | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) 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 f1798338ea0..c8043a94299 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 @@ -170,8 +170,10 @@ The following example shows how to remesh a conforming constrained Delaunay tria \cgalExample{Constrained_triangulation_3/remesh_constrained_Delaunay_triangulation_3.cpp } -\section CT_3_design Design and Implementation History +\section CT_3_design Implementation History + +The first version of this package was implemented by Laurent Rineau, and published in 2025 in CGAL 6.1. It is based on the theoretical foundation provided by Hang Si's work on meshing algorithms +\cgalCite{si2005meshing}, \cgalCite{si2015tetgen}. -\todo implementation history */ } /* namespace CGAL */