Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees

DOI10.1007/978-3-319-27261-0_37zbMath1471.68290OpenAlexW2295739338MaRDI QIDQ2959779

Maarten Löffler, André Schulz, Stephane Durocher, Clinton Bowen, Anika Rounds, Csaba D. Tóth

Publication date: 10 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27261-0_37

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) 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) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Unit disk representations of embedded trees, outerplanar and multi-legged graphs ⋮ Finding geometric representations of apex graphs is NP-hard ⋮ Morphing triangle contact representations of triangulations ⋮ Computing stable Demers cartograms ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ Morphing Contact Representations of Graphs ⋮ Unnamed Item