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

DOI10.1007/978-3-319-27261-0_37zbMath1471.68290MaRDI 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

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count, Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs, Unnamed Item, Computing stable Demers cartograms