Rectangular dualization and rectangular dissections
From MaRDI portal
Publication:3813827
DOI10.1109/31.14464zbMath0663.05027OpenAlexW2041379189MaRDI QIDQ3813827
Edwin Kinnen, Krzysztof A. Kozminski
Publication date: 1988
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/31.14464
Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)
Related Items (12)
Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Enumerating floorplans with walls ⋮ Optimal polygonal representation of planar graphs ⋮ Transformations among rectangular partitions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Simple and efficient floor-planning ⋮ Floorplanning by graph dualization: \(L\)-shaped modules ⋮ On area-efficient drawings of rectangular duals for VLSI floor-plan ⋮ A theory of L-shaped floor-plans
This page was built for publication: Rectangular dualization and rectangular dissections
