Improved floor-planning of graphs via adjacency-preserving transformations

DOI10.1007/s10878-010-9324-8zbMath1239.05183MaRDI QIDQ411253

Huaming Zhang, Sadish Sadasivam

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9324-8

zbMATH Keywords

plane triangulation; floor-plan; irreducible triangulation; rectangular dual

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05B45: Combinatorial aspects of tessellation and tiling problems

Related Items

On \(k\)-greedy routing algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of rectangular dual graphs
• Simple and efficient floor-planning
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Planar graphs and poset dimension
• Floorplanning by graph dualization: \(L\)-shaped modules
• Planar polyline drawings via graph transformations
• Rectangular duals of planar graphs
• Rectangular dualization and rectangular dissections
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• On Floor-Plan of Plane Graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Compact floor-planning via orderly spanning trees
• On Planar Polyline Drawings
• Graph Drawing