A better heuristic for area-compaction of orthogonal representations
From MaRDI portal
Publication:2489402
Recommendations
- On the complexity of orthogonal compaction
- scientific article; zbMATH DE number 2185601
- scientific article; zbMATH DE number 1342138
- scientific article; zbMATH DE number 2080085
- scientific article; zbMATH DE number 2084272
- Optimal area-sensitive bounds for polytope approximation
- Turn-regularity and optimal area drawings of orthogonal representations
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Efficient algorithms for orthogonal packing problems
Cites work
- Floorplans, planar graphs, and layouts
- Graph theory
- scientific article; zbMATH DE number 2185601 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- Turn-regularity and optimal area drawings of orthogonal representations
- Upward drawings of triconnected digraphs.
Cited in
(8)- A framework for 1-D compaction with forbidden region avoidance
- Turn-regularity and optimal area drawings of orthogonal representations
- scientific article; zbMATH DE number 2185601 (Why is no real title available?)
- scientific article; zbMATH DE number 2084272 (Why is no real title available?)
- scientific article; zbMATH DE number 2080085 (Why is no real title available?)
- On Turn-Regular Orthogonal Representations
- On turn-regular orthogonal representations
- Parameterized approaches to orthogonal compaction
This page was built for publication: A better heuristic for area-compaction of orthogonal representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489402)