[Drawkit] Now with added testing. (was Re: For the brave ; -)

[Uli Kusterer]

On 01.08.2008, at 04:34, Graham Cox wrote:
> If the placement is irregular the problem you would need to deal  
> with is making sure it detected every object at least once so that  
> none got forgotten, and marking each one already found so that none  
> were visited twice. I expect that the path found by this approach  
> would be non-optimal for most irregular cases, but could well be  
> acceptable.


  At worst, one could always run both algorithms (heck, most Macs  
these days have dual cores, you could probably run them  
simultaneously) and then check which one is better. Really interesting  
topic, this is :-)

Cheers,
-- Uli Kusterer
"The Witnesses of TeachText are everywhere..."
http://www.zathras.de