of
planar curves, compute all intersection points among them,
obtain the set of maximal pairwise interior-disjoint subcurves
of the curves in , or check whether there is at
least one pair of curves in that intersect in
their interior.
This chapter describes three functions implemented using the
sweep-line algorithm: given a collection of
planar curves, compute all intersection points among them,
obtain the set of maximal pairwise interior-disjoint subcurves
of the curves in , or check whether there is at
least one pair of curves in that intersect in
their interior.
The first two operations are performed in an output-sensitive manner.
CGAL::get_intersection_points
CGAL::get_subcurves
CGAL::do_curves_intersect
| do_curves_intersect |
| get_intersection_points |
| get_subcurves |