CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

An alternative solution is to use this:

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Box_intersection_d/Chapter_main.html

and in particular this function:
CGAL::box_intersection_d

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Box_intersection_d_ref/Function_box_intersection_d.html#Cross_link_anchor_1715

Sebastien.

Graviton wrote:
> I have two groups of line segments, and I want to find the intersection
> between them. I understand that one can use 
> http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Sweep_line_2/Chapter_main.html
> sweep line algorithm  to find all the intersection points within one line
> groups. But now I have 2 line segment groups, and I want to find the
> intersection between line in Group A and line in Group B ( I don't want the
> intersection point between line segments among group A and line segments
> among group B).
>
> Any idea how CGAL can help in this?
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Find-all-the-intersection-points-between-2-line-groups-tp4168063p4168063.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.