> This is done with: SWIG_CGAL_FORWARD_AND_FILTER_CALL_GF_2
As I understand the macros, I rather need a
SWIG_CGAL_FORWARD_AND_FILTER_CALL_GF_1 for the do_curves_intersect(),
which currently does not exist (I added this to my
I tried to copy the stuff to my code for the do_curves_intersect()
function, but now I get an undefined symbol for that. The problem is
that I don't really understand what I'm doing, so I don't know how to
come up with a solution myself...
> As long as you have no constructions, you can still make a conversion
> to an exact kernel (like what is done in the intersection package)
> but if you have constructions then it gets tricky.
I'm not sure how that would work. Actually the only thing I need at this
point, is to pass a set of segments to CGAL an get for each segment a
subset of intersecting segments. The reason why I'd like to use the
sweep line approach is that I want to stay in sub-quadratic running time
(with respect to the number of segments).
> The easiest way to handle this is to wrap the whole functionality in C++
> and expose a simplified API with SWIG.
Sounds like a good idea for now!
Thank you both for your quick help! I pushed my changes to my repository
 and would be glad if you find time to have a look at it at some
point or even implement working bindings for the Sweep_line_2 module. :-)