Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] self-intersecting beziers and arrangement algorithms

Subject: CGAL users discussion list

List archive

[cgal-discuss] self-intersecting beziers and arrangement algorithms


Chronological Thread 
  • From: Ben Supnik <>
  • To:
  • Subject: [cgal-discuss] self-intersecting beziers and arrangement algorithms
  • Date: Wed, 03 Mar 2010 09:55:54 -0500

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?

Thanks!!!
Ben




--
Scenery Home Page: http://scenery.x-plane.com/
Scenery blog: http://xplanescenery.blogspot.com/
Plugin SDK: http://www.xsquawkbox.net/xpsdk/
X-Plane Wiki: http://wiki.x-plane.com/
Scenery mailing list:

Developer mailing list:




Archive powered by MHonArc 2.6.16.

Top of Page