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

Merge lrineau/Triangulation_3-CDT_3-lrineau

This commit is contained in:
Laurent Rineau 2025-04-03 11:01:23 +02:00
parent e889e638b1 e90f226e61
commit 7afe51a43b
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -15,7 +15,7 @@ namespace CGAL {
\section CT_3_CCDT_3 Conforming Delaunay Triangulations in 3D
This package implements the construction of a 3D conforming Delaunay triangulation,
constrained to a set of faces of a surface polygon mesh.
constrained to a set of faces of a Piecewise Linear Complex.
For any Piecewise Linear Complex (PLC) in 3D,
the algorithm builds a Constrained Delaunay triangulation conforming to this PLC.
@ -100,7 +100,7 @@ Right : the same CCDT seen with cutplane.
\subsection CT_3_api_classes Classes
This package provides one main class `Conforming_constrained_Delaunay_triangulation_3`
that represents a 3D conforming Delaunay triangulation.
that represents a 3D conforming constrained Delaunay triangulation.
The class is templated by the geometric traits class and the underlying triangulation class.
The other classes that are provided are secondary classes that define the
vertex and cell types and metadata that constitute the triangulation.
@ -112,7 +112,7 @@ are provided to create a `Conforming_constrained_Delaunay_triangulation_3` objec
\section CT_3_examples Examples
\subsection CT_3_example_ccdt Build a conforming constrained Delaunay triangulation
\subsection CT_3_example_ccdt Build a Conforming Constrained Delaunay Triangulation
The following example shows how to use the helper constructor function
`make_conforming_constrained_Delaunay_triangulation_3()` to create a
@ -121,7 +121,7 @@ conforming constrained Delaunay triangulation from a given PLC.
\cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp }
\subsection CT_3_example_ccdt_soup Build a conforming constrained Delaunay triangulation from a polygon soup
\subsection CT_3_example_ccdt_soup Build a Conforming Constrained Delaunay Triangulation from a Polygon Soup
It is also possible to create a conforming constrained Delaunay triangulation
from a polygon soup, i.e., a set of polygons for which the connectivity is not known a priori.
@ -130,7 +130,7 @@ This example shows an example of building such a triangulation.
\cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp }
\subsection CT_3_example_ccdt_fpmap Build a conforming constrained Delaunay triangulation with known face patches
\subsection CT_3_example_ccdt_fpmap Build a Conforming Constrained Delaunay Triangulation with Known Face Patches
When the user knows a priori the set of patch ids that he wants to attach to faces, this information
can be used and kept valid through the construction of the conforming constrained
@ -152,7 +152,7 @@ Figure \cgalFigureRef{ccdt_fpmap} shows the input and output of this triangulati
<!-- #camera 5.67784 5.7193 -5.46546 0.830007 -0.459002 0.09482 -0.302349 -->
\subsection CT_3_example_remesh Remeshing a conforming constrained Delaunay triangulation
\subsection CT_3_example_remesh Remeshing a Conforming Constrained Delaunay Triangulation
Once the triangulation is built, it is possible to remesh it using the
`CGAL::tetrahedral_isotropic_remeshing()` function from the \ref PkgTetrahedralRemeshing package,