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

Update from review

This commit is contained in:
Simon Giraudot 2020-03-12 11:26:10 +01:00
parent f05ec48bda
commit 4c0a3788c3
2 changed files with 10 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -308,10 +308,10 @@ Each computed polyline is stored as a constraint of the triangulation.
\warning all existing constraints will be discarded.
\param is_terminal An optional function returning true if the vertex
`v` of degree 2 is a polyline endpoint and false otherwise. If no
function is provided, a default function is provided that returns true
for vertices whose degree is different from 2.
\param is_terminal An optional function returning `true` if the vertex
`v` of degree 2 is a polyline endpoint and `false` otherwise. If
omitted, a function always returning `false` will be used, that is no
degree 2 vertex will be considered as a polyline endpoint.
\sa `split_graph_into_polylines()`
*/

11
Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
View File

@ -1128,13 +1128,14 @@ through the edge.
The `Constrained_triangulation_plus_2` structure is initialized by a
set of polylines. As users may only be able to provide a disconnected
segment soup as input, a member function
[split_subconstraint_graph_into_constraints()](@ref Constrained_triangulation_plus_2::split_subconstraint_graph_into_constraints())
is provided: this function identifies the polylines by connecting
segments until a vertex whose degree is different than 2 is reached.
segment soup as input, a member function \link
Constrained_triangulation_plus_2::split_subconstraint_graph_into_constraints()
`split_subconstraint_graph_into_constraints()` \endlink is provided:
this function identifies the polylines by connecting segments until a
vertex whose degree is different from 2 is reached.
The following code shows how a "blind" insertion of disconnected
polylines can be processed into a set of well-defined polyline
segments can be processed into a set of well-defined polyline
constraints in a `Constrained_triangulation_plus_2`:
\cgalExample{Triangulation_2/segment_soup_to_polylines.cpp}