CGAL users discussion list

[Zohar <>]

HW again?

I suppose you meant: Find the minimum number of rectangles that covers your
domain, which in turn consists of only straight lines.

Pass a sweep line from top to bottom. Each boundary vertex that you meet
would be an incident. At an incident decompose the sweep line to inside an
outside, and that would compose the number of rects for this event.

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/How-to-fill-rectangles-in-the-domain-tp4468174p4497547.html
Sent from the cgal-discuss mailing list archive at Nabble.com.