Constrained floorplans in 2D and 3D
DOI10.1016/J.TCS.2015.07.063zbMATH Open1332.68166OpenAlexW1140966411MaRDI QIDQ896113FDOQ896113
Authors: 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
Recommendations
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)
Cites Work
- Compact floor-planning via orderly spanning trees
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Area-universal and constrained rectangular layouts
- Computing cartograms with optimal complexity
- Rectangular duals of planar graphs
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- Orthogonal cartograms with few corners per face
- Two layer 3D floor planning
- Drawing slicing graphs with face areas
- A simple optimal binary representation of mosaic floorplans and Baxter permutations
- On orthogonally convex drawings of plane graphs (extended abstract)
Cited In (6)
- Two layer 3D floor planning
- Floorplanning by graph dualization: \(L\)-shaped modules
- Rectilinear duals using monotone staircase polygons
- A transformation algorithm to construct a rectangular floorplan
- Enumerating Floorplans with Some Properties
- Floorplanning with abutment constraints based on corner block list
This page was built for publication: Constrained floorplans in 2D and 3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896113)
