114
Voted
CCCG
2007
15 years 4 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...