Octagonal drawings of plane graphs with prescribed face areas

Authors:
Md. Saidur Rahman;Kazuyuki Miura;Takao Nishizeki
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka-1000, Bangladesh;Faculty of Symbiotic System Science, Fukushima University, Fukushima 960-1296, Japan;Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, Sendai 980-8579, Japan
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 15
Cited 4

Arboricity and subgraph listing algorithms

SIAM Journal on Computing
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
On area-efficient drawings of rectangular duals for VLSI floor-plan

Mathematical Programming: Series A and B
Floor-planning by graph dualization: 2-concave rectilinear modules

SIAM Journal on Computing
Sliceable Floorplanning by Graph Dualization

SIAM Journal on Discrete Mathematics
Rectangular grid drawings of plane graphs

Computational Geometry: Theory and Applications
On Floor-Plan of Plane Graphs

SIAM Journal on Computing
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
Optimal BSPs and rectilinear cartograms

GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
On rectangular cartograms

Computational Geometry: Theory and Applications
Orthogonal drawings for plane graphs with specified face areas

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On rectilinear duals for vertex-weighted plane graphs

GD'05 Proceedings of the 13th international conference on Graph Drawing
Octagonal drawings of plane graphs with prescribed face areas

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A fast algorithm for area minimization of slicing floorplans

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Orthogonal cartograms with few corners per face

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
How to visualize the k-root name server (demo)

GD'11 Proceedings of the 19th international conference on Graph Drawing
Linear-time algorithms for hole-free rectilinear proportional contact graph representations

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Orthogonal cartograms with at most 12 corners per face

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An orthogonal drawing of a plane graph is called an octagonal drawing if each inner face is drawn as a rectilinear polygon of at most eight (polygonal) vertices and the contour of the outer face is drawn as a rectangle. A slicing graph is obtained from a rectangle by repeatedly slicing it vertically and horizontally. A slicing graph is called a good slicing graph if either the upper subrectangle or the lower one obtained by any horizontal slice will never be vertically sliced, roughly speaking. In this paper we show that every good slicing graph has an octagonal drawing with prescribed face areas, in which the area of each inner face is equal to a prescribed value. Such a drawing has practical applications in VLSI floorplanning. We also give a linear-time algorithm to find such a drawing when a ''slicing tree'' is given. We furthermore present a sufficient condition for a plane graph to be a good slicing graph.