Re: gEDA-dev: topological routing path search algorithms

[Werner Hoch <werner_dot_ho-at-NOSPAMgmx_dot_de>]

Hi Anthony,

On Thursday 22 March 2007 03:41, Anthony Blake wrote:
> Can anyone point me in the direction of information on topological
> routing (books/papers)? I've come across a few good papers but they
> all require IEEE xplore access and don't seem to be available
> anywhere else. Any help would be appreciated.

Can you provide the summaries of the articles you need?

Something like this:
---------------
Planar topological routing
Lim, A.; Thanvantri, V.; Sahni, S.;
Computer-Aided Design of Integrated Circuits and Systems, IEEE 
Transactions on
Volume 16,  Issue 6,  June 1997 Page(s):651 - 656
Digital Object Identifier 10.1109/43.640623
Summary: We develop a simple linear time algorithm to determine if a 
collection of two-pin nets can be routed, topologically, in a plane 
(i.e., single layer). Experiments indicate that this algorithm is 
faster than the linear time algorithm of Marek-Sadowska .....
--------------

I can ask a colleague next week, whether he has access to the required 
papers.

Regards
Werner


_______________________________________________
geda-dev mailing list
geda-dev@moria.seul.org
http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev