>On a side note, this sounds a lot like the traveling salesman puzzle where one
>tries to find the quickest route for a salesman that must visit a bunch of
>cities.
Ooooh. Good insight, Zonn! I didn't see this connection before.
Yah, finding the *optimal* route is NP-complete (meaning no
polynomial-time algorithm exists), but given an arbitrary unsorted set of
line segments you generally can order them such that the total time to draw
them is (possibly significantly) shorter than the time to draw the original
unsorted set. It's only finding the optimal ordering that is hard.
Drew
