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

examples in user manual

This commit is contained in:
Jane Tournois 2025-03-11 12:39:45 +01:00
parent bed5b9393b
commit 9f34149717
4 changed files with 17 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -83,21 +83,29 @@ are provided to create a `Conforming_constrained_Delaunay_triangulation_3` objec
\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 ... The following example shows how to use the helper constructor function
`make_conforming_constrained_Delaunay_triangulation_3()` to create a
conforming constrained Delaunay triangulation from a given PLC.
\cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp } \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
or 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.
This example shows an example of building such a triangulation.
\cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp } \cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp }
\subsection CT_3_example_remesh Remeshing a conforming constrained Delaunay triangulation \subsection CT_3_example_remesh Remeshing a conforming constrained Delaunay triangulation
remeshing... Once the triangulation is built, it is possible to remesh it using the
`CGAL::tetrahedral_isotropic_remeshing()` function from the \ref PkgTetrahedralRemeshing package,
to improve the quality of the mesh or adapt it to a given sizing field.
The following example shows how to remesh a conforming constrained Delaunay triangulation.
\cgalExample{Constrained_triangulation_3/remesh_constrained_Delaunay_triangulation_3.cpp } \cgalExample{Constrained_triangulation_3/remesh_constrained_Delaunay_triangulation_3.cpp }

2
Constrained_triangulation_3/examples/Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp
View File

@ -29,4 +29,6 @@ int main(int argc, char* argv[])
<< ccdt.number_of_constrained_facets() << '\n'; << ccdt.number_of_constrained_facets() << '\n';
CGAL::draw(ccdt.triangulation()); CGAL::draw(ccdt.triangulation());
return EXIT_SUCCESS
} }

2
Constrained_triangulation_3/examples/Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp
View File

@ -30,4 +30,6 @@ int main(int argc, char* argv[])
<< ccdt.number_of_constrained_facets() << '\n'; << ccdt.number_of_constrained_facets() << '\n';
CGAL::draw(ccdt.triangulation()); CGAL::draw(ccdt.triangulation());
return EXIT_SUCCESS;
} }

2
Constrained_triangulation_3/examples/Constrained_triangulation_3/remesh_constrained_Delaunay_triangulation_3.cpp
View File

@ -40,4 +40,6 @@ int main(int argc, char* argv[])
std::cout << "Number of vertices in tr: " std::cout << "Number of vertices in tr: "
<< tr.number_of_vertices() << std::endl; << tr.number_of_vertices() << std::endl;
CGAL::draw(ccdt.triangulation()); CGAL::draw(ccdt.triangulation());
return EXIT_SUCCESS;
} }