Name
Abstract | ||
|---|---|---|
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. In our model we assume that between two consecutive layers every net is allowed to occupy only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics. First we assume that the nodes have already been fixed on a layered hypergraph structure. We consider the problem of assigning the hyper- edges between two layers to tracks. The idea is to minimize the total number of hyperedge crossings. We prove that finding the best solution is NP-hard. Then, in contrast to many other approaches which route all the wiring after placing all nodes we focus on a new approach which dynami- cally reorders the nodes within the layers to further reduce the number of hyperedge crossings. An efficient algorithm is presented that minimizes the hyperedge crossings. Experimental results are provided which show that the drawings can be improved significantly while the running time remains moderate. |
Year | Venue | Keywords |
|---|---|---|
2006 | J. Graph Algorithms Appl. | electronic design automation |
Field | DocType | Volume |
Visibility,Combinatorics,Computer science,Hypergraph,Theoretical computer science | Journal | 10 |
Issue | Citations | PageRank |
2 | 9 | 0.59 |
References | Authors | |
15 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Eschbach | 1 | 33 | 4.00 |
| Wolfgang Günther | 2 | 9 | 0.59 |
| Bernd Becker | 3 | 9 | 0.59 |