mirror of https://github.com/CGAL/cgal
small change
This commit is contained in:
parent
ff5821180c
commit
96c008da4e
|
|
@ -10,7 +10,7 @@ bool do_curves_intersect (InputIterator curves_begin,
|
|||
Traits& traits);}
|
||||
{given a range of curves, check whether there is at least one pair of curves
|
||||
that intersect in their interior. The function returns \ccc{true} if such
|
||||
a pair is found, and \ccc{false} if the curves are pairwise disjoint in
|
||||
a pair is found, and \ccc{false} if all curves are pairwise disjoint in
|
||||
their interior.The \ccc{Traits} type must be a model
|
||||
of the \ccc{ArrangementTraits_2} concept, such that the value-type of
|
||||
\ccc{InputIterator} is \ccc{Traits::Curve_2}.}
|
||||
|
|
|
|||
Loading…
Reference in New Issue