A better heuristic for area-compaction of orthogonal representations

DOI10.1016/j.amc.2005.03.007zbMath1090.65026OpenAlexW2045588023MaRDI QIDQ2489402

Maryam Tahmasbi, S. Mehdi Hashemi

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.03.007

zbMATH Keywords

polynomial time algorithmplanar graphorthogonal drawingorthogonal representationupward planarityarea compactioncomplete saturator

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

On Turn-Regular Orthogonal Representations ⋮ On Turn-Regular Orthogonal Representations

Cites Work

• Upward drawings of triconnected digraphs.
• Turn-regularity and optimal area drawings of orthogonal representations
• Floorplans, planar graphs, and layouts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A better heuristic for area-compaction of orthogonal representations