CGAL Namespace Reference

Namespaces
namespace	Surface_sweep_2

Functions
template<typename InputIterator , typename 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<typename InputIterator , typename 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<typename InputIterator , typename 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<typename InputIterator , typename OutputIterator , typename 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<typename InputIterator >
bool	do_curves_intersect (InputIterator curves_begin, InputIterator curves_end)
template<typename InputIterator , typename Traits >
bool	do_curves_intersect (InputIterator curves_begin, InputIterator curves_end, Traits traits=Default_traits())