CGAL 6.0.1 - 2D Intersection of Curves
Loading...
Searching...
No Matches
CGAL Namespace Reference

Functions

template<class InputIterator , class OutputIterator >
OutputIterator compute_intersection_points (InputIterator curves_begin, InputIterator curves_end, OutputIterator points, bool report_endpoints=false)
 Given a range of curves, compute all intersection points between two (or more) input curves.
 
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator compute_intersection_points (InputIterator curves_begin, InputIterator curves_end, OutputIterator points, bool report_endpoints=false, Traits traits)
 Given a range of curves, compute all intersection points between two (or more) input curves.
 
template<class InputIterator , class OutputIterator >
OutputIterator compute_subcurves (InputIterator curves_begin, InputIterator curves_end, OutputIterator subcurves, bool multiple_overlaps=false)
 Given a range of curves, compute all \( x\)-monotone subcurves that are pairwise disjoint in their interior, as induced by the input curves.
 
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator compute_subcurves (InputIterator curves_begin, InputIterator curves_end, OutputIterator subcurves, bool multiple_overlaps=false, Traits traits=Default_traits())
 Given a range of curves, compute all \( x\)-monotone subcurves that are pairwise disjoint in their interior, as induced by the input curves.
 
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.
 
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.