Low Ply Drawings of Trees

DOI10.1007/978-3-319-50106-2_19zbMath1478.68210arXiv1608.08538OpenAlexW2512551299MaRDI QIDQ2961519

Patrizio Angelini, Antonios Symvonis, Michael A. Bekos, Stephen G. Kobourov, Jaroslav Hančl Jr., Pavel Valtr, Till Bruckdorfer, Michael Kaufmann

Publication date: 21 February 2017

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

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Low Ply Drawings of Trees ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ On Vertex- and Empty-Ply Proximity Drawings

Cites Work

• Classes and recognition of curve contact graphs
• Unit disk graph recognition is NP-hard
• A data structure for dynamic trees
• Balanced Circle Packings for Planar Graphs
• Low Ply Drawings of Trees

This page was built for publication: Low Ply Drawings of Trees