Subject: CGAL users discussion list
List archive
- From: Efraim Fogel <>
- To:
- Subject: Re: [cgal-discuss] self-intersecting beziers and arrangement algorithms
- Date: Wed, 03 Mar 2010 18:33:47 +0200
Ben Supnik wrote:
> Hi Y'all,
>
> I am using the bezier curve traits with the sweep algorithm to find
> intersections in closed bezier general polygons.
>
> The manual for the bezier traits curve_2 says:
>
> "The only resriction we have is that the curve does not contain any
> self-intersections."
>
> The precondition for the constructor says:
>
> "The input range must contain at least two control points, and the
> polyline defined by these points must not be self-intersecting."
>
> But...from what I can tell:
>
> - The sweep line at least works correctly even if either of these
> preconditions is violated.
>
> - The code appears to at least intentionally handle the first case
> (self-intersections).
>
> Is this a case of (a) the manual over-states the preconditions or (b)
> the code does not check the preconditions, and may be functioning
> incorrectly in a way I have not detected?
I have a feeling that self intersections are handled correctly after all
as opposed to the statement in the manual. I'll try to investigate.
>
> Thanks!!!
> Ben
--
____ _ ____ _
/_____/_) o /__________ __ //
(____ ( ( ( (_/ (_/-(-'_(/
_/
- [cgal-discuss] self-intersecting beziers and arrangement algorithms, Ben Supnik, 03/03/2010
- Re: [cgal-discuss] self-intersecting beziers and arrangement algorithms, Efraim Fogel, 03/03/2010
Archive powered by MHonArc 2.6.16.