Subject: CGAL users discussion list
List archive
- From: Nicolas CHARVIN <>
- To:
- Subject: [cgal-discuss] How to obtain the list of intersecting segments ?
- Date: Wed, 8 Nov 2017 18:01:50 +0100
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
Hello, [Disclaimenr: I am a brand new CGAL user, and C++ isn't my main programming language] I am currently performing simulation on nanowires networks. So, within a large number N of random segments, I need to detect for each segment which segments it is intersecting. Naive implementation works well, but of course in O(N2). I wish I could use sweepline algorithms to perform this way faster, as described in the example "sweep_line.cpp". It works really fast (up to 100,000 segments) but unfortunately, "compute_intersection_points" only return the intersections points, not the two segments involved. Searching in the list, I found that some people need the same thing in 2012: https://sympa.inria.fr/sympa/arc/cgal-discuss/2012-11/msg00149.html It has been told in the thread that "Arrangement_with_history_2" might do the trick. But I have no idea what it means. Does anyone have any hints to help ? Regards, Nicolas --
|
- [cgal-discuss] How to obtain the list of intersecting segments ?, Nicolas CHARVIN, 11/08/2017
- Re: [cgal-discuss] How to obtain the list of intersecting segments ?, Efi Fogel, 11/11/2017
Archive powered by MHonArc 2.6.18.