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

add link and use html list

This commit is contained in:
Jane Tournois 2025-06-05 15:11:18 +02:00
parent 6a08b3bdc9
commit 1120750e0c
1 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -259,8 +259,9 @@ to resolve the self-intersections.
\subsection CT_3_example_remesh Remeshing a Conforming Constrained Delaunay Triangulation \subsection CT_3_example_remesh Remeshing a Conforming Constrained Delaunay Triangulation
After constructing the triangulation, you can improve its quality or adapt it to a specific sizing After constructing the triangulation, you can improve its quality or adapt it to a specific sizing
field by applying the `CGAL::tetrahedral_isotropic_remeshing()` function from the \ref field by applying the
PkgTetrahedralRemeshing package. \link CGAL::tetrahedral_isotropic_remeshing(CGAL::Triangulation_3<Traits, TDS, SLDS>&, const SizingFunction&, const NamedParameters&) `CGAL::tetrahedral_isotropic_remeshing()`\endlink
function from the \ref PkgTetrahedralRemeshing package.
The following example demonstrates how to remesh a conforming constrained Delaunay triangulation. The following example demonstrates how to remesh a conforming constrained Delaunay triangulation.
@ -276,11 +277,12 @@ constrained Delaunay triangulation.
From top to bottom, the lines show different input data (all from) the same input triangulated surface and, From top to bottom, the lines show different input data (all from) the same input triangulated surface and,
for each of them, the resulting conforming constrained Delaunay triangulation. for each of them, the resulting conforming constrained Delaunay triangulation.
The input data are: The input data are:
* the input PLC with no preprocessing; <ul>
* the input PLC with a segmentation of the surface patches done with `CGAL::Polygon_mesh_processing::region_growing_of_planes_on_faces()` as done in example \ref CT_3_example_ccdt_region_growing_fimap; <li> the input PLC with no preprocessing;
* the input PLC, remeshed and not triangulated, with a segmentation of the surface patches, done with `CGAL::Polygon_mesh_processing::remesh_planar_patches()` as in example \ref CT_3_example_ccdt_fimap; <li> the input PLC with a segmentation of the surface patches done with `CGAL::Polygon_mesh_processing::region_growing_of_planes_on_faces()` as done in example \ref CT_3_example_ccdt_region_growing_fimap;</li>
* the input PLC, isotropically remeshed, with a segmentation of the surface patches, done with `CGAL::Polygon_mesh_processing::region_growing_of_planes_on_faces()` as in example \ref CT_3_example_ccdt_region_growing_fimap. <li> the input PLC, remeshed and not triangulated, with a segmentation of the surface patches, done with `CGAL::Polygon_mesh_processing::remesh_planar_patches()` as in example \ref CT_3_example_ccdt_fimap;</li>
<li> the input PLC, isotropically remeshed, with a segmentation of the surface patches, done with `CGAL::Polygon_mesh_processing::region_growing_of_planes_on_faces()` as in example \ref CT_3_example_ccdt_region_growing_fimap.</li>
</ul>
It is interesting to note that the conforming constrained Delaunay triangulations built from the same input PLC, but with different It is interesting to note that the conforming constrained Delaunay triangulations built from the same input PLC, but with different
preprocessing steps, can yield different results. preprocessing steps, can yield different results.