Inner rectangular drawings of plane graphs

Authors:
Kazuyuki Miura;Hiroki Haga;Takao Nishizeki
Affiliations:
Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 17
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
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
Clique partitions, graph compression and speeding-up algorithms

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Floor-planning by graph dualization: 2-concave rectilinear modules

SIAM Journal on Computing
On finding the rectangular duals of planar triangular graphs

SIAM Journal on Computing
Flow in Planar Graphs with Multiple Sources and Sinks

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
Rectangular drawings of plane graphs without designated corners

Computational Geometry: Theory and Applications
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing

GD '96 Proceedings of the Symposium on Graph Drawing
Extended Rectangular Drawings of Plane Graphs with Designated Corners

GD '02 Revised Papers from the 10th International 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
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle In this paper we show that a plane graph G has an inner rectangular drawing D if and only if a new bipartite graph constructed from G has a perfect matching We also show that D can be found in time O(n1.5/log n) if G has n vertices and a sketch of the outer face is prescribed, that is, all the convex outer vertices and concave ones are prescribed.