Anthony Blake wrote: > Hi Everyone, > > As some of you know I've been developing a topological autorouter for > PCB as part of the google summer of code.
> - It currently only supports through-hole tech, because it isn't yet > importing the geometry of pads etc from PCB as constraints for the > autorouter; > - It doesn't yet support planes and polygons; > - Designs incorporating high-density packages such as BGA's really > require a heuristic; > - Results would be greatly enhanced through the use of topologies other > than euclidean minimum spanning tree (EMST), such as a force-driven > constrained steiner-tree. > > As well as fixing bugs, I will be tackling these issues in the coming weeks. > > Any comments would be appreciated!! Your write up and before/after examples seem fabulous! Congrats on condensing the info from past research papers in your biblio into working code. That's no small feat. What have you got in mind for heuristic rules to deal with BGA-like packages? Will you have a user input file for specifying zones to route, such as quadrants, when the package is a square arrangement? How about user definitions of what is "good layout" to use as starting point for next autoroute run? Thanks for your GPL'd work. I'll spend soem time trying it out to generate more comments. John Griessen _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
