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

Improve sentence

This commit is contained in:
Clement Jamin 2015-10-23 17:47:47 +02:00
parent 077e9c43eb
commit 02d4e438e7
1 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Triangulation/doc/Triangulation/Triangulation.txt
View File

@ -402,8 +402,11 @@ circumscribing ball whose interior does not contain
any vertex of the triangulation. any vertex of the triangulation.
In case of degeneracies (co-spherical points) the triangulation is not In case of degeneracies (co-spherical points) the triangulation is not
uniquely defined. Note however that the \cgal implementation computes a unique uniquely defined. Note however that the \cgal implementation computes
triangulation even in these cases. one of the possible Delaunay triangulations.
The computed triangulation is uniquely defined for a given insertion
order of the points (which is always the same if inserted using
`CGAL::Delaunay_triangulation::insert(ForwardIterator s, ForwardIterator e)`).
When a new point `p` is inserted into a Delaunay triangulation, the When a new point `p` is inserted into a Delaunay triangulation, the
full cells whose circumscribing ball contains `p` are said to full cells whose circumscribing ball contains `p` are said to