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

typos

This commit is contained in:
Andreas Fabri 2014-11-04 12:34:24 +01:00
parent 42d04ea13f
commit 9b85ad7d97
4 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
View File

@ -41,7 +41,7 @@ public:
/// Initializes the cost function with the specified `ratio`
Hybrid_squared_distance_cost( FT ratio ) : mSquaredRatio(ratio*ratio) {}
/// Given a vertex in constraint iterator `vicq` computes `vicp= std::prev(vicq)` and vicr = std::next(vicr)`,
/// Given a vertex in constraint iterator `vicq` computes `vicp= std::prev(vicq)` and `vicr = std::next(vicr)`,
/// returns the maximal square distance between each point along the original subpolyline,
/// between `vicp` and `vicr`,
/// and the straight line segment from `*vicp->point() to *vicr->point()` divicded by the smallest of

2
Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
View File

@ -40,7 +40,7 @@ public:
/// Initializes the cost function.
Scaled_squared_distance_cost() {}
/// Given a vertex in constraint iterator `vicq` computes `vicp= std::prev(vicq)` and vicr = std::next(vicr)`,
/// Given a vertex in constraint iterator `vicq` computes `vicp= std::prev(vicq)` and `vicr = std::next(vicr)`,
/// returns the maximum of the square distances between each point along the original subpolyline
/// between `vicp` and `vicr`,
/// and the straight line segment from `*vicp->point() to *vicr->point()` divided by the shortest squared distance between

2
Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
View File

@ -47,7 +47,7 @@ public:
/// Initializes the cost function
Squared_distance_cost() {}
/// Given a vertex in constraint iterator `vicq` computes `vicp = std::prev(vicq)` and vicr = std::next(vicr)`,
/// Given a vertex in constraint iterator `vicq` computes `vicp = std::prev(vicq)` and `vicr = std::next(vicr)`,
/// returns the maximum of the square distances between each point along the original subpolyline,
/// between `vicp` and `vicr`, and the straight line segment from `*vicp->point() to *vicr->point()`.
/// \tparam CDT must be `CGAL::Constrained_Delaunay_triangulation_2` with a vertex type that

4
Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h
View File

@ -378,7 +378,9 @@ typedef unspecified_type Points_in_constraint_iterator;
Removes the vertex at `vicq` from the constraint and the triangulation.
Only the vertex but not the point is removed from the constraint.
Let `vip` and `viq` be defined as `vip = std::prev(vicq)` and vir = std::next(vicr)`,
\pre Let `vip` and `viq` be defined as `vip = std::prev(vicq)` and `vir = std::next(vicr)`.
\pre `vicq` must neither be the first, nor the last vertex on a constraint.
\pre No other constraint must pass through `vicq`.
\pre The line segment between `*vicp->point()` and `*vicr->point()` must not intersect any constraint.