Skip to Content.
Sympa Menu

cgal-discuss - sweep line algorithm for horizontal/vertical lines

Subject: CGAL users discussion list

List archive

sweep line algorithm for horizontal/vertical lines


Chronological Thread 
  • From:
  • To:
  • Subject: sweep line algorithm for horizontal/vertical lines
  • Date: Sun, 22 Jul 2007 16:29:12 +0200

Hi all,

is there an algorithm in CGAL which computes the number of intersections of a
bunch of horizontal and vertical lines? I don´t need to know which lines
intersect or the exact intersection point. But only the info that some lines
intersect is not enough.

I found the sweep line algorithm in CGAL, but i suspect it´s oversized,
because i only have horizonal or vertical lines.

Do you think there is a faster algorithm regarding these constraints or is it
ok to use the algo from CGAL? Or is there a simple way to modify the existing
sweep line algorithm?


Thanks in advance!

Sebastian



Archive powered by MHonArc 2.6.16.

Top of Page