Anthony Blake wrote: > Ben Jackson wrote: >> On Wed, Jul 09, 2008 at 07:02:12PM +1200, Anthony Blake wrote: >>> If anyone is interested in the topological autorouter I'm working on, >> Looks neat! Nice presentation of the progress. >> >> I'm curious: What do your internal data structures look like, and how >> applicable would they be as a replacement for PCB's own clunky internals? >> > > The data structures are still pretty sketchy, but I think there are > parts which could be put back into PCB. In particular, using the > delaunay triangulation code we can do EMST in O(nlogn) time rather than > the O(n^2) with the current code. When moving only a few points, we > would only end up doing the computation for those points, and then > generating the MST in linear time. This should improve the rats-nest code.
If it improves the rats-nest code enough it might be time to make it an easy option to have the rats nets re-optimized every time something is moved. -Dan _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
