Skip to content

Latest commit

 

History

History
13 lines (11 loc) · 960 Bytes

README.md

File metadata and controls

13 lines (11 loc) · 960 Bytes

SPAR1

C Code from MS Thesis work in Automatic Schematics Generation (ASG)

This code presents a new approach to routing schematic diagrams. Probably the most valuable contribution is the local and global routing heuristics that were implemented. Heuristic global and local algorithms are presented which focus on congestion and crossover issues in the develop  ment of aesthetically pleasing diagrams  Congestion is the basis for the global  and crossover for the local router  This algorithm can work on a completed schematic but it is a work in progress to apply them to schematics that are incrementally developed and/or interactive. 

For those seriously interested, these algorithms were published in IEEE Transactions on Computer-Aided Design of ICAS in 1993: Stephen T. Frezza and Steven P. Levitan, “SPAR: A Schematic Place and Route System.'' IEEE Transactions on Computer-Aided Design of ICAS, Vol. 12, No. 7, July 1993, pp. 956-973.