[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]

Re: gEDA-user: Toporouter Changes



> Kind of like providing the circuit-board equivalent of a geological
> topographical/relief map, so the algorithms know where the "valleys"
> (preferred paths) and "peaks" (mountains, don't climb them unless
> necessary) are?

"An Application of Simulated Annealing to Maze Routing"
http://geda.seul.org/mailinglist/geda-dev6/msg00028.html



>  And the lakes, airports, Area 51's, etc....  Except
> that with circuit boards it would be more than 3-D, because some of the
> mountains would be abstract things like excessive trace length (which
> might later trigger the addition of a via and then a retry), DRC rules,
> desire to avoid the extreme edges of the board, and so on...  An [n]-D
> "relief map"...

Might be worth revisiting the following, but looks like
Anthony is well beyond this point.

 "Autorouting with the A* algorithm",
 by Randall Nevin , in
Dr. Dobb's Journal of Software Tools,
Volume 14, Number 9, September, 1989.

http://www.ddj.com/184408202?pgno=14
http://www.ddj.com/184408202
http://www.geda.seul.org/mailinglist/geda-user94/msg00129.html

I think Harry may have implemented part of A* in the existing
auto router.


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