mirror of https://github.com/CGAL/cgal
21 lines
704 B
TeX
21 lines
704 B
TeX
\ccRefChapter{2D Intersection of Curves}
|
|
\ccChapterAuthor{Baruch Zukerman \and Ron Wein}
|
|
|
|
|
|
This chapter describes three functions implemented using the
|
|
sweep-line algorithm: given a collection ${\mathcal C}$ of
|
|
planar curves, compute all intersection points among them,
|
|
obtain the set of maximal pairwise interior-disjoint subcurves
|
|
of the curves in ${\mathcal C}$, or check whether there is at
|
|
least one pair of curves in ${\mathcal C}$ that intersect in
|
|
their interior.
|
|
|
|
The first two operations are performed in an output-sensitive
|
|
manner.
|
|
|
|
\subsection*{Functions}
|
|
|
|
\ccRefIdfierPage{CGAL::get_intersection_points}\\
|
|
\ccRefIdfierPage{CGAL::get_subcurves}\\
|
|
\ccRefIdfierPage{CGAL::do_curves_intersect}
|