mirror of https://github.com/CGAL/cgal
24 lines
846 B
TeX
24 lines
846 B
TeX
|
|
\begin{ccPkgDescription}{3D Triangulations\label{Pkg:Triangulation3}}
|
|
\ccPkgHowToCiteCgal{cgal:pt-t3-06}
|
|
\ccPkgSummary{
|
|
This package allows to build and handle
|
|
triangulations for point sets in three dimensions.
|
|
Any CGAL triangulation covers the convex hull of its
|
|
vertices. Triangulations are build incrementally
|
|
and can be modified by insertion or removal of vertices.
|
|
They offer point location facilities.
|
|
|
|
The package provides plain triangulation (whose faces
|
|
depends on the insertion order of the vertices) and
|
|
Delaunay triangulations. Regular triangulations are
|
|
also provided for sets of weighted points.
|
|
Delaunay and regular
|
|
triangulations offer nearest neighbor queries
|
|
and primitives to build the dual Voronoi and power diagrams.}
|
|
|
|
%\ccPkgDependsOn{}
|
|
\ccPkgIntroducedInCGAL{2.1}
|
|
\ccPkgLicense{\ccLicenseQPL}
|
|
\end{ccPkgDescription}
|