|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re**4: Comparing 2-D co-ordinatesby belg4mit (Prior) |
| on Jul 31, 2003 at 15:47 UTC ( [id://279627]=note: print w/replies, xml ) | Need Help?? |
|
You want the to take the smallest number of your original
segments which, combined, cover as much of the range as
possible, with no overlaps. This sounds like a solved
problem. ie; check some algorythm books/websites
--
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||