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

Update doc according to Menelaos review

This commit is contained in:
Clement Jamin 2014-05-23 17:02:52 +02:00
parent 19f4c90954
commit 174fde081e
4 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
Triangulation/doc/Triangulation/CGAL/Delaunay_triangulation.h
View File

@ -161,7 +161,6 @@ Full_cell_handle c);
Returns `true` if and only if the point `p` is in (Delaunay)
conflict with full cell `c` (i.e., the circumscribing ball of
\f$ c\f$ contains \f$ p\f$ in its interior).
*/
bool is_in_conflict(const Point & p, Full_cell_const_handle c)
const;

4
Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
View File

@ -9,7 +9,9 @@ It brings the geometric ingredient to the
definition of a triangulation, while the combinatorial ingredient is brought by
the second template parameter, `TriangulationDataStructure`.
\cgalRefines `SpatialSortingTraits_d` If a range of points is inserted, the
\cgalRefines `SpatialSortingTraits_d`
If a range of points is inserted, the
traits must refine `SpatialSortingTraits_d` (this operation is optimized using
spatial sorting). This is not required if the points are inserted one by one.

10
Triangulation/doc/Triangulation/Triangulation.txt
View File

@ -132,12 +132,12 @@ us denote the maximal dimension with \f$ D \f$ and the current dimension with \f
The inequalities \f$ -2 \leq d \leq D\f$ and \f$ 0 \le D\f$ always hold.
The special meaning of negative values for \f$d\f$ is explained below.
### The data structure triangulates \f$ \mathcal S^d\f$ ###
### The data structure triangulates \f$ \mathbb{S}^d\f$ ###
A `TriangulationDataStructure` can be viewed as
a triangulation of the topological sphere \f$ \mathcal S^d\f$,
a triangulation of the topological sphere \f$ \mathbb{S}^d\f$,
i.e., its faces can be embedded to form a partition of
\f$ \mathcal S^d\f$ into \f$d\f$-simplices.
\f$ \mathbb{S}^d\f$ into \f$d\f$-simplices.
One nice consequence of the above important fact is that a full cell has
always exactly \f$ d+1\f$ neighbors.
@ -157,7 +157,7 @@ the two full cells being neighbors of each other. This is the unique
triangulation of the \f$ 0\f$-sphere.
<!--- (geometrically, the finite vertex and the infinite vertex),--->
<DT><B>\f$ 0< d \le D\f$</B><DD> This corresponds to a triangulation of
the sphere \f$ \mathcal S^d\f$.
the sphere \f$ \mathbb{S}^d\f$.
</DL>
</BLOCKQUOTE>
@ -357,7 +357,7 @@ structure as described in the previous section.
The following example shows how to construct a triangulation in which we insert
random points. In `STEP 1`, we generate one hundred random points in
\f$ \mathcal R^5\f$, which we then insert into a triangulation. In `STEP 2`, we
\f$ \mathbb{R}^5\f$, which we then insert into a triangulation. In `STEP 2`, we
ask the triangulation to construct the set of edges
(\f$ 1\f$ dimensional faces) incident to the vertex at infinity. It is easy to see that
these edges are in bijection with the vertices on the convex hull of the

2
Triangulation/include/CGAL/Delaunay_triangulation.h
View File

@ -178,7 +178,7 @@ public:
// the user can specify a Flat_orientation_d object to be used for
// orienting simplices of a specific dimension
// (= preset_flat_orientation_.first)
// It it used for by dark triangulations created by DT::remove
// It it used by the dark triangulations created by DT::remove
Delaunay_triangulation(
int dim,
const std::pair<int, const Flat_orientation_d *> &preset_flat_orientation,