Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
Function

CGAL::do_curves_intersect

#include <CGAL/Sweep_line_2_algorithms.h>

template <class InputIterator>
bool do_curves_intersect ( InputIterator curves_begin, InputIterator curves_end)
Given a range of curves, check whether there is at least one pair of curves that intersect in their interior. The function returns true if such a pair is found, and false if all curves are pairwise disjoint in their interior. The value-type of InputIterator is a curve type.
template <class InputIterator, class Traits>
bool
do_curves_intersect ( InputIterator curves_begin,
InputIterator curves_end,
Traits traits = Default_traits())
Given a range of curves, check whether there is at least one pair of curves that intersect in their interior. The function returns true if such a pair is found, and false if all curves are pairwise disjoint in their interior. The Traits type must be a model of the ArrangementTraits_2 concept, such that the value-type of InputIterator is Traits::Curve_2.

Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
CGAL Open Source Project. Release 4.2. 7 March 2013.