Constrained floorplans in 2D and 3D

DOI10.1016/j.tcs.2015.07.063zbMath1332.68166OpenAlexW1140966411MaRDI QIDQ896113

Yi-Jun Chang, Hsu-Chun Yen

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.063

zbMATH Keywords

rectilinear polygonplane graphfloorplanningrectilinear dual

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

A transformation algorithm to construct a rectangular floorplan

Cites Work

• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Two layer 3D floor planning
• Drawing slicing graphs with face areas
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• On Orthogonally Convex Drawings of Plane Graphs
• Area-Universal and Constrained Rectangular Layouts
• Rectangular duals of planar graphs
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Compact floor-planning via orderly spanning trees
• Orthogonal Cartograms with Few Corners Per Face
• Computing cartograms with optimal complexity

This page was built for publication: Constrained floorplans in 2D and 3D