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

- Put implementation stuff together in one paragraph.

This commit is contained in:
Sylvain Pion 2003-09-03 16:44:50 +00:00
parent 451202d45f
commit 55190b05e1
2 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Packages/Triangulation_3/doc_tex/Triangulation_3/Triang3.tex
View File

@ -162,8 +162,7 @@ sufficient for practical cases.
\section{Delaunay Triangulation}
The class \ccc{Delaunay_triangulation_3} represents a three-dimensional
Delaunay triangulation. This implementation is fully dynamic: it
supports both insertions of points and vertex removal.
Delaunay triangulation.
Delaunay triangulations have the specific \textit{empty sphere property},
that is, the circumscribing sphere of each cell of such a triangulation
@ -172,6 +171,8 @@ These triangulations are uniquely defined except in degenerate cases
where five points are cospherical. Note however that the \cgal\ implementation
computes a unique triangulation even in these cases.
This implementation is fully dynamic: it supports both insertions of points
and vertex removal.
The user is advised to use the class \ccc{Triangulation_hierarchy_3} in
order to benefit from an increased efficiency for large data sets.

5
Packages/Triangulation_3/doc_tex/basic/Triangulation_3/Triang3.tex
View File

@ -162,8 +162,7 @@ sufficient for practical cases.
\section{Delaunay Triangulation}
The class \ccc{Delaunay_triangulation_3} represents a three-dimensional
Delaunay triangulation. This implementation is fully dynamic: it
supports both insertions of points and vertex removal.
Delaunay triangulation.
Delaunay triangulations have the specific \textit{empty sphere property},
that is, the circumscribing sphere of each cell of such a triangulation
@ -172,6 +171,8 @@ These triangulations are uniquely defined except in degenerate cases
where five points are cospherical. Note however that the \cgal\ implementation
computes a unique triangulation even in these cases.
This implementation is fully dynamic: it supports both insertions of points
and vertex removal.
The user is advised to use the class \ccc{Triangulation_hierarchy_3} in
order to benefit from an increased efficiency for large data sets.