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

doc fixes

This commit is contained in:
Jane Tournois 2025-06-13 16:21:37 +02:00
parent 9fb6dafd39
commit ec02088928
2 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -114,7 +114,7 @@ Right: the same CCDT seen with cutplane.
\cgalFigureCaptionEnd \cgalFigureCaptionEnd
\section CT_3_api Software Design \section CT_3_design Software Design
\subsection CT_3_representation_of_PLCs Representation of Piecewise Linear Complexes \subsection CT_3_representation_of_PLCs Representation of Piecewise Linear Complexes
@ -242,7 +242,7 @@ The following example demonstrates how to construct a conforming constrained Del
an input mesh that is not triangulated and may contain self-intersections, an input mesh that is not triangulated and may contain self-intersections,
using autorefinement. using autorefinement.
\cgalExample{Constrained_triangulation_3/ccdt_3_preprocessing.cpp } \cgalExample{Constrained_triangulation_3/ccdt_3_after_autorefinement.cpp }
The function The function
\link CGAL::Polygon_mesh_processing::does_self_intersect(const FaceRange&, const TriangleMesh&, const NamedParameters&) `CGAL::Polygon_mesh_processing::does_self_intersect()` \endlink \link CGAL::Polygon_mesh_processing::does_self_intersect(const FaceRange&, const TriangleMesh&, const NamedParameters&) `CGAL::Polygon_mesh_processing::does_self_intersect()` \endlink
@ -298,7 +298,7 @@ The left column shows the input PLC, while the right column displays the resulti
\cgalFigureCaptionEnd \cgalFigureCaptionEnd
\section CT_3_design Implementation History \section CT_3_history Implementation History
The initial version of this package was implemented by Laurent Rineau and released in The initial version of this package was implemented by Laurent Rineau and released in
\cgal 6.1 (2025). Jane Tournois contributed to the documentation and helped improve the API. \cgal 6.1 (2025). Jane Tournois contributed to the documentation and helped improve the API.

3
Constrained_triangulation_3/doc/Constrained_triangulation_3/examples.txt
View File

@ -33,7 +33,7 @@ From a non-manifold OFF file, construct the constrained Delaunay triangulation.
/*! /*!
\example Constrained_triangulation_3/ccdt_3_preprocessing.cpp \example Constrained_triangulation_3/ccdt_3_after_autorefinement.cpp
@brief @brief
From a self-intersecting and non-triangulated surface in an OFF file, From a self-intersecting and non-triangulated surface in an OFF file,
@ -44,4 +44,5 @@ construct the constrained Delaunay triangulation after preprocessing by autorefi
\example Constrained_triangulation_3/ccdt_3_check_preconditions.cpp \example Constrained_triangulation_3/ccdt_3_check_preconditions.cpp
\example Constrained_triangulation_3/ccdt_3_fimap_region_growing.cpp \example Constrained_triangulation_3/ccdt_3_fimap_region_growing.cpp
\example Constrained_triangulation_3/ccdt_3_from_soup_fimap.cpp \example Constrained_triangulation_3/ccdt_3_from_soup_fimap.cpp
\example Constrained_triangulation_3/ccdt_3_preprocessing.cpp
*/ */