CGAL users discussion list

[Efi Fogel <>]

Consider constructing a 2d-arrangement induced by the curves (using the aggregate insert() free function, which is based on the surface-sweep framework).

In particular, construct an object the type of which is an instance of Arrangement_with_history_2, or extend the arrangement to your needs and use an observer to update the extended data (see, e.g., the face_extension.cpp example of the Arrangement_on_surface_2 package).

All the information you mention can be extracted from the arrangement object.

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

On 12 July 2018 at 13:14, brainslush <> wrote:

I have a list of segments and want to determine where and with what
other segments they are intersecting unsing the sweep algorithm.
The part for obtaining the intersection positions is straight forward
from the tutorial / example.
https://doc.cgal.org/latest/Surface_sweep_2/index.html

What steps would I have to take to obtain the the segments/curves
involed in the intersection?

Kind Regards,
Benjamin




--
Sent from: http://cgal-discuss.949826.n4.nabble.com/

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss