Improved floor-planning of graphs via adjacency-preserving transformations

DOI10.1007/S10878-010-9324-8MaRDI QIDQ411253zbMATH OpenOpenAlexFDO

Authors 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 triangulationfloor-planirreducible triangulationrectangular dual

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of tessellation and tiling problems (05B45)

Recommendations

• On Floor-Plan of Plane Graphs
• Planar polyline drawings via graph transformations
• A transformation algorithm to construct a rectangular floorplan
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• On local transformations in plane geometric graphs embedded on small grids

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 2086693 (Why is no real title available?)
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• A theory of rectangular dual graphs
• Compact floor-planning via orderly spanning trees
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Floorplanning by graph dualization: \(L\)-shaped modules
• Graph Drawing
• On Finding the Rectangular Duals of Planar Triangular Graphs
• On Floor-Plan of Plane Graphs
• On Planar Polyline Drawings
• Planar graphs and poset dimension
• Planar polyline drawings via graph transformations
• Rectangular dualization and rectangular dissections
• Rectangular duals of planar graphs
• Simple and efficient floor-planning

Cited in

(3)

• On k-greedy routing algorithms
• A transformation algorithm to construct a rectangular floorplan
• Construction of floorplans for plane graphs over polygonal boundaries

This page was built for publication: Improved floor-planning of graphs via adjacency-preserving transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411253)