Hi Everyone, As some of you know I've been developing a topological autorouter for PCB as part of the google summer of code. The summer of code is now finished, and although the autorouter isn't really ready for users, it is routing some simple boards, and is already demonstrating advantages over PCB's current maze router.
Please see http://www.wand.net.nz/~amb33/toporouter/ for more information, and a couple of screenshots of output. A few limitations which prevent it being used on real boards: - 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!! Cheers, Anthony Blake _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
