gEDA-dev: Net routing

[Peter Clifton]

On Mon, 2008-02-25 at 23:27 +0000, Peter Clifton wrote:
> On Mon, 2008-02-25 at 23:08 +0100, Werner Hoch wrote:
> 
> > @Peter:
> > As we have the tile code, do you think we need a more efficient 
> > implementation to track down the connections at the start net point?
> 
> Probably not, although bear in mind there aren't "that" many tiles, and
> they span the entire legal world coordinate space. Tiles are quite large
> IIRC.

Of course.. the really useful optimisation in using the tiles is that
only connectible objects are listed. That would probably be a pretty big
speed-up even if it were just the one large tile.

-- 
Peter Clifton

Electrical Engineering Division,
Engineering Department,
University of Cambridge,
9, JJ Thomson Avenue,
Cambridge
CB3 0FA

Tel: +44 (0)7729 980173 - (No signal in the lab!)