CGAL users discussion list

If you continue with the overlay operation, then perhaps you can  
reduce the overhead of constructing the arrangement from the mesh.  
More precisely, if the line segments of the mesh are pairwise disjoint  
in their interior, you can construct the arrangement efficiently using  
member functions of the arrangement data-structure,i.e.,  
arr.insert_in_face_interior(), arr.insert_from_{left,right}_vertex,  
and arr.insert_between_vertices().

Quoting Graviton 
<>:

> Thanks, using the overlay is a good idea.
>
> Now I want to throw one more information into the mix; what if, one of the
> line group is actually a polygonal mesh? Anything we can exploit from the
> mesh structure of this line, so that the whole process can be speed up?
>
> On Thu, Dec 8, 2011 at 12:34 AM, Efraim Fogel [via cgal-discuss] <
> >
>  wrote:
>
> > Using the a plane-sweep algorithm is probably the most efficient
> > approach. You are looking for something similar to the overlay
> > operation, but in your case you need only the intersections (not the
> > arrangements). Sometimes this is also referred to as red-blue
> > intersections.
> >
> > The Sweep_line_2 component of CGAL is an algorithmic framework. A
> > concrete algorithm is implemented through a visitor. Unfortunately, we
> > haven't exposed the interface of the visitor yet. If you want to use
> > this component, you must do one of the following:
> > 1. Use the overlay mechanism: Construct 2 arrangements, say A and B,
> > from the 2 sets of lines, respectively, and compute their overlay
> > using the overlay() function while using, what we call, an overlay
> > traits (the 3rd argument to the function). The answer to what you need
> > lies in this traits.
> > 2. Change the visitor of the overlay (Arr_overlay_sl_visitor.h) to do
> > what you need.
> >
> > Quoting Graviton <[hidden  
> > email]<http://user/SendEmail.jtp?type=node&node=4169572&i=0>>:
> >
> >
> > > 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.
> > >
> > > --
> > > You are currently subscribed to cgal-discuss.
> > > To unsubscribe or access the archives, go to
> > > https://lists-sop.inria.fr/wws/info/cgal-discuss
> > >
> > >
> >
> >
> > --
> > You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://lists-sop.inria.fr/wws/info/cgal-discuss
> >
> >
> >
> > ------------------------------
> >  If you reply to this email, your message will be added to the discussion
> > below:
> >
> > http://cgal-discuss.949826.n4.nabble.com/Find-all-the-intersection-points-between-2-line-groups-tp4168063p4169572.html
> >  To unsubscribe from Find all the intersection points between 2 line
> > groups, click  
> > here<http://cgal-discuss.949826.n4.nabble.com/template/NamlServlet.jtp?macro=unsubscribe_by_code&node=4168063&code=c29vbmh1aS5uZ3VAZ21haWwuY29tfDQxNjgwNjN8NDk0OTIzNDUy>
> > .
> > NAML<http://cgal-discuss.949826.n4.nabble.com/template/NamlServlet.jtp?macro=macro_viewer&id=instant_html%21nabble%3Aemail.naml&base=nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.view.web.template.InstantMailNamespace&breadcrumbs=instant+emails%21nabble%3Aemail.naml-instant_emails%21nabble%3Aemail.naml-send_instant_email%21nabble%3Aemail.naml>
>
>
> --
> View this message in context:  
> http://cgal-discuss.949826.n4.nabble.com/Find-all-the-intersection-points-between-2-line-groups-tp4168063p4171393.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss