Optimal orientations of cells in slicing floorplan designs
Information and Control
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Floor-planning by graph dualization: 2-concave rectilinear modules
SIAM Journal on Computing
A linear-time algorithm for drawing a planar graph on a grid
Information Processing Letters
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple linear time algorithm for proper box rectangular drawings of plane graphs
Journal of Algorithms
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Proceedings of the 8th Annual International Conference on Computing and Combinatorics
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Revised Papers from the 9th International Symposium on Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Bend Minimization in Orthogonal Drawings Using Integer Programming
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
2-Visibility Drawings of Planar Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Floor-Planning via Orderly Spanning Trees
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Box-Rectangular Drawings of Plane Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
On finding most optimal rectangular package plans
DAC '82 Proceedings of the 19th Design Automation Conference
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An application of well-orderly trees in graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable of unifying known results as well as deriving new results in graph drawing. Our exploration in this paper provides new evidence to demonstrate such a potential. Two applications of the orderly spanning trees of plane graphs are investigated. Our first application deals with Podevs drawing, i.e., planar orthogonal drawing with equal vertex size, introduced by F枚脽meier and Kaufmann. Based upon orderly spanning trees, we give an algorithm that produces a Podevs drawing with half-perimeter no more than 驴3n/2驴 + 1 and at most one bend per edge for any n-node plane graph with maximal degree 驴, a notable improvement over the existing results in the literature in terms of the size of the drawing area. The second application is an alternative proof for the sufficient and necessary condition for a graph to admit a rectangular dual, i.e., a floor-plan using only rectangles.