CGAL users discussion list

[Ben Supnik <>]

Hi Y'all,

The CGAL manual lists the time complexity of sweep-line algorithms as

O((n+k) log n)

where n is the number of curves, and k is the number of intersections.

Here are my stupid questions:

1. Do two curves with a common end-point count as an intersection?  (I 
would imagine yes?)

2. Do the ends of the curves count as intersections (e.g. vertices in 
the arrangement with degree 1)?

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: