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