CGAL users discussion list

[Efraim Fogel <>]

Jerome BENOIT wrote:
> Hello List,
>
> As newbie in C++ and in CGAL, note that I am familiar with C, I have a
> naive question concerning
> the function CGAL::compute_intersection_points (2D Intersection of
> Curves).
>
> In fact, I would like to get not only the list of intersection points,
> but also the pairs of the involved segments.
>
> Is it possible to implement, using the current CGAL library, the same
> function but
> that return the list of the pairs of segments that intersect (with the
> intersection point) ?
>
> Thanks in advance,
> Jerome
Currently, such an option does not exists.

It's not extremely hard to implement. To get this done, you need to
implement a dedicated visitor class for the sweepline. Currently, among
the others, we have (i) a visitor that inserts curve into an empty
(resp. non empty) arrangement, (ii) a visitor that computes the overlay
of 2 arrangements, and (iii) a visitor that computes the intersections
between a given set of curves you mentioned. To develop the new one, you
can start with the latter, and change it.

-- 
  ____  _        ____             _
 /_____/_) o    /__________  __  //
(____ (   (    (    (_/ (_/-(-'_(/
                        _/