Rectangular layouts and contact graphs

DOI10.1145/1328911.1328919zbMath1445.68154arXivcs/0611107OpenAlexW1973624728MaRDI QIDQ4962700

Emden R. Gansner, Cecilia M. Procopiuc, Suresh Venkatasubramanian, Adam L. Buchsbaum

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0611107

zbMATH Keywords

contact graphsrectangular dualsrectangular layouts

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (13)

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Contact Representations of Graphs in 3D ⋮ Layered area-proportional rectangle contact representations ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Is the spiral effect psychological? ⋮ Optimal polygonal representation of planar graphs ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ Computing cartograms with optimal complexity ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Improved approximation algorithms for box contact representations ⋮ Unnamed Item ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ Proportional Contact Representations of Planar Graphs

This page was built for publication: Rectangular layouts and contact graphs