Simple and efficient floor-planning

DOI10.1016/S0020-0190(02)00490-8zbMath1173.68768MaRDI QIDQ1007584

Maciej Kurowski

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmsfloor-plannear-triangulation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Unnamed Item ⋮ A theory of L-shaped floor-plans

Cites Work

• A theory of rectangular dual graphs
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Floorplanning by graph dualization: \(L\)-shaped modules
• Algorithms for drawing graphs: An annotated bibliography
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple and efficient floor-planning