We consider the wiring or layer assignment problem for edgedisjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see [8]). In this paper, we introduce a more general approach to this problem. For an edgedisjoint layout in the plane resp. in an arbitrary planar layout graph, we give equivalent conditions for the k-layer wirability. Based on these conditions, we obtain linear-time algorithms to wire every layout in a trihexagonal grid, respectively every layout in a tri-square-hexagon~l grid using at most five layers.
CITATION STYLE
Kuchem, R., & Wagner, D. (1997). Wiring edge-disjoint layouts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1190, pp. 271–285). Springer Verlag. https://doi.org/10.1007/3-540-62495-3_54
Mendeley helps you to discover research relevant for your work.