CALCULATION OF THE MINIMUM PATH LENGTH WIRE IN THE PRINTED WIRING TOPOLOGICAL ROUTING
Read the full article
There is a problem to calculate the path (shape) of a wire by its topological path in the topological approach to the wire routing. An algorithm which calculates the minimum length path of the wire considering design rules is proposed. The algorithm is used for wire shapes calculation in TopoR electronic design automation.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License