CGAL users discussion list

[Efi Fogel <>]

I suggest that you construct an arrangement-with-history and traverse its cells.

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

On 7 June 2017 at 17:25, Maxim Torgonskiy <> wrote:

Hello,

I need to verify whether two 2D curves 1) don't intersect, or 2) intersect, or 3) one contains another. The curves contain straight line segments and arc segments. I've found an overlay function in Arrangement_2 [1] which cover all the three cases. The problem is to verify whether the output arrangement is equal to one of the input arrangements. Is there any method to do the check? I've found only [2] equality operator in the code but it seems that it is not what I'm looking for. 

An example of input curves : c1 = (-1,0) -> (0,0) -> (0,1) -> (0,2) -> (2,1) ; c2 = (0,0.5) -> (0,1.5)

Thanks,

Maxim

[1] http://doc.cgal.org/latest/Arrangement_on_surface_2/group__PkgArrangement2Funcs.html#ga339cdba93f54001be303595689002396

[2] http://doc.cgal.org/latest/Arrangement_on_surface_2/classCGAL_1_1Arr__consolidated__curve__data__traits__2_1_1Data__container.html#a65e976dab3da0814cadcc05f882d6e2a