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

add an intro to Triangulation_3 user manual

This commit is contained in:
Laurent Rineau 2025-06-16 12:08:21 +02:00
parent 487c570eca
commit 07b3574b19
3 changed files with 25 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -66,7 +66,7 @@ The goal of the algorithms developed in this package is to compute a constrained
triangulation that contains a given set of polygonal constraints in 3D as a subcomplex. triangulation that contains a given set of polygonal constraints in 3D as a subcomplex.
A triangulation is a _Delaunay triangulation_ if the circumscribing sphere of any simplex A triangulation is a _Delaunay triangulation_ if the circumscribing sphere of any simplex
in the triangulation contains no vertex in its interior (see package \ref PkgTriangulation3 in the triangulation contains no vertex in its interior (see chapter \ref PkgTriangulation3
for more details on Delaunay triangulations). for more details on Delaunay triangulations).
A _constrained Delaunay triangulation_ of a PLC is a constrained triangulation that is as close as A _constrained Delaunay triangulation_ of a PLC is a constrained triangulation that is as close as

14
Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
View File

@ -11,6 +11,20 @@ namespace CGAL {
\image html triangulation3.png \image html triangulation3.png
\image latex triangulation3.png \image latex triangulation3.png
This chapter describes the three-dimensional triangulations of \cgal. Section \ref
Triangulation3secdef recalls the main definitions related to 3D triangulations. Section
\ref Triangulation3secintro discusses how three-dimensional triangulations are represented
in \cgal. Section \ref Triangulation3secdesign presents the overall software design of the 3D
triangulations package. The following sections introduce the different three-dimensional
triangulation classes available in \cgal: basic triangulations (Section \ref Triangulation3secintro),
Delaunay triangulations (Section \ref Triangulation_3Delaunay),
and regular triangulations (Section \ref Triangulation3secclassRegulartriangulation).
The chapter \ref PkgConstrainedTriangulation3 adds 3D constrained
Delaunay triangulations, which are built on top of the basic 3D triangulations described here.
\section Triangulation3secdef Definition
The basic 3D-triangulation class of \cgal is primarily designed to The basic 3D-triangulation class of \cgal is primarily designed to
represent the triangulations of a set of points \f$ A\f$ in \f$ \mathbb{R}^3\f$. It is represent the triangulations of a set of points \f$ A\f$ in \f$ \mathbb{R}^3\f$. It is
a partition of the convex hull of \f$ A\f$ into tetrahedra whose vertices a partition of the convex hull of \f$ A\f$ into tetrahedra whose vertices

19
Triangulation_3/doc/Triangulation_3/dependencies
View File

@ -1,11 +1,12 @@
Manual
Kernel_23
STL_Extension
Algebraic_foundations Algebraic_foundations
Convex_hull_3
Circulator
Spatial_sorting
Stream_support
Triangulation_2
TDS_3
BGL BGL
Circulator
Constrained_triangulation_3
Convex_hull_3
Kernel_23
Manual
Spatial_sorting
STL_Extension
Stream_support
TDS_3
Triangulation_2