Extended Rectangular Drawings of Plane Graphs with Designated Corners

Authors:
Kazuyuki Miura;Ayako Miyazawa;Takao Nishizeki
Affiliations:
-;-;-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 8
Cited 1

Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
On finding the rectangular duals of planar triangular graphs

SIAM Journal on Computing
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
On Floor-Plan of Plane Graphs

SIAM Journal on Computing
Rectangular drawings of plane graphs without designated corners

Computational Geometry: Theory and Applications
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing

GD '96 Proceedings of the Symposium on Graph Drawing
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

Inner rectangular drawings of plane graphs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line segment, and all faces including the outer face are drawn as rectangles. In this paper, we introduce an "extended rectangular drawing" in which all inner faces are drawn as rectangles but the outer face is drawn as a rectilinear polygon with designated corners, and give a necessary and sufficient condition for a plane graph to have an extended rectangular drawing.