Subject: CGAL users discussion list
List archive
- From: "Amit Pendharkar" <>
- To:
- Subject: [cgal-discuss] Intersection of segments
- Date: Fri, 18 Jul 2008 11:54:52 -0500
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type; b=gWip2Zl/FfswsacgHxqBRLIYFrvllGqunw9iiKkeRIbpHCxoaGm58jbrkwnPTfE64J NcxpFJBvyFxJajAaON4SwV0BKgCHiRs1Ck8Dv7iclgfDSTp5+oWHcWUcVrGHKHOY5DEE ErDrvlH5r+4JTeYE2d3L+sJXCroKLwAoASyOM=
Hi All,
I want to find if the given two segments or a segment and a point intersect or not.
I am trying to use SegmentDelaunayGraphTraits_2::Arrangement_type (that takes values DISJOINT, IDENTICAL, CROSSING etc) and the function arrangement_type(), but it gives me error saying that its protected.
How do I define Arrangement_type & make use of arrangement_type() to find the intersection point if any?
I don't really want to make use of the sweep line algorithm as explained in Chapter21: 2D Intersection of Curves of cgal manual.
All i/ps are highly appreciated.
Thanks & Regards,
Amit Pendharkar
I want to find if the given two segments or a segment and a point intersect or not.
I am trying to use SegmentDelaunayGraphTraits_2::Arrangement_type (that takes values DISJOINT, IDENTICAL, CROSSING etc) and the function arrangement_type(), but it gives me error saying that its protected.
How do I define Arrangement_type & make use of arrangement_type() to find the intersection point if any?
I don't really want to make use of the sweep line algorithm as explained in Chapter21: 2D Intersection of Curves of cgal manual.
All i/ps are highly appreciated.
Thanks & Regards,
Amit Pendharkar
- [cgal-discuss] Intersection of segments, Amit Pendharkar, 07/18/2008
- Re: [cgal-discuss] Intersection of segments, Julien Demouth, 07/18/2008
Archive powered by MHonArc 2.6.16.