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

add section "Traits and Kernel Choice"

This commit is contained in:
Laurent Rineau 2025-06-16 17:09:54 +02:00
parent a001ee036a
commit 664e8dcd63
1 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt
View File

@ -162,6 +162,16 @@ PkgConstrainedTriangulation3FunctionsPolygonSoupOrMesh
`CGAL::make_conforming_constrained_Delaunay_triangulation_3()`\endlink are provided to facilitate the creation
of a `CGAL::Conforming_constrained_Delaunay_triangulation_3` object from either a surface mesh or a polygon soup.
\subsection CT_3_geomtraits Traits and Kernel Choice
The requirements on geometric objects and operations are described in the traits class concept
`ConformingConstrainedDelaunayTriangulationTraits_3`. Any CGAL kernel is a model of this concept, but
the package is designed to work with kernels that provide exact predicates.
As the Steiner points are inserted on the input edges and polygons of the PLC, the coordinates of
those points will be constructed. If the input data set has almost-coplanar input polygons, a kernel
with exact constructions must be used to ensure the correct placement of these points.
\section CT_3_examples Examples
\subsection CT_3_example_ccdt Build a Conforming Constrained Delaunay Triangulation