On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
A linear-time algorithm for drawing a planar graph on a grid
Information Processing Letters
Relating bends and size in orthogonal graph drawings
Information Processing Letters
Area-efficient algorithms for straight-line tree drawings
Computational Geometry: Theory and Applications
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings
GD '96 Proceedings of the Symposium on Graph Drawing
Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Rectangular drawings of planar graphs
Journal of Algorithms
Straight-line drawings of general trees with linear area and arbitrary aspect ratio
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Hi-index | 0.00 |
Double-tree-scan (DTS) is a new scan-path architecture that is deemed to be suitable for low-power testing of VLSI circuits. A full DTS resembles two complete k-level (k 0) binary trees whose leaf nodes are merged pair-wise, and thus consists of exactly N$_{k}$ = 3 × 2$^{k}$ − 2 nodes. In this paper, the problem of planar straight-line embedding of a "double-tree graph" on a rectangular grid is investigated and an O(N$_{k}$) time algorithm for drawing it, is described. The embedding requires at most 2N$_{k}$ grid points, with an aspect ratio lying between 1 and &frac32;. Next, techniques of embedding a partial DTS is considered when the number of nodes n ≠ 3 × 2$^{k}$ − 2, for some k. Layouts of double-tree scan-paths for some benchmark circuits are also presented to demonstrate the results.