Box-Rectangular Drawings of Plane Graphs

Authors:
Md. Saidur Rahman;Shin-Ichi Nakano;Takao Nishizeki
Affiliations:
-;-;-
Venue:
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1999

Citing 13
Cited 1

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science
Rectangular grid drawings of plane graphs

Computational Geometry: Theory and Applications
Orthogonally drawing cubic graphs in parallel

Journal of Parallel and Distributed Computing
Algorithms for VLSI Physical Design Automation

Algorithms for VLSI Physical Design Automation
Optimal Orthogonal Drawings of Triconnected Plane Graphs

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
2-Visibility Drawings of Planar Graphs

GD '96 Proceedings of the Symposium on Graph Drawing
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits.

DAC '84 Proceedings of the 21st Design Automation Conference

Some Applications of Orderly Spanning Trees in Graph Drawing

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new drawing style of a plane graph G, called a "box-rectangular drawing." It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a simple linear-time algorithm to find a box-rectangular drawing of G if it exists.