Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Recommendations
Cited in
(35)- Octagonal drawings of plane graphs with prescribed face areas
- Drawing slicing graphs with face areas
- Simple and efficient floor-planning
- Floorplanning by graph dualization: \(L\)-shaped modules
- Table cartogram
- A transformation algorithm to construct a rectangular floorplan
- A theory of L-shaped floor-plans
- Layered area-proportional rectangle contact representations
- On orthogonally convex drawings of plane graphs
- Triangulating with high connectivity.
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- Rectilinear duals using monotone staircase polygons
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Floorplans, planar graphs, and layouts
- scientific article; zbMATH DE number 21366 (Why is no real title available?)
- Improved floor-planning of graphs via adjacency-preserving transformations
- MULTI-HOPE: A tool for multiple floor layout problems
- On Floor-Plan of Plane Graphs
- scientific article; zbMATH DE number 1559558 (Why is no real title available?)
- Floorplanning with abutment constraints based on corner block list
- Sliceable Floorplanning by Graph Dualization
- Recent developments in floorplan representations
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- Strong mixed-integer formulations for the floor layout problem
- Computing cartograms with optimal complexity
- Proportional contact representations of planar graphs
- Linear-time construction of floor plans for plane triangulations
- Adjacency graphs of polyhedral surfaces
- A graph theoretic approach for generating T-shaped floor plans
- Construction of floorplans for plane graphs over polygonal boundaries
- Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique
- Existence and construction of a C-shaped module within a floorplan
- Constrained floorplans in 2D and 3D
- Good spanning trees in graph drawing
- A theory of rectangular dual graphs
This page was built for publication: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202209)
