Pole dancing: 3D morphs for tree drawings

DOI10.1007/978-3-030-04414-5_27OpenAlexW2888997073MaRDI QIDQ1725773

Alessandra Tappini, Vida Dujmović, Anthony D'Angelo, Prosenjit Bose, Pilar Cano, Elena Arseneva, Stefan Langerman, Fabrizio Frati

Publication date: 15 February 2019

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

Mathematics Subject Classification ID

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

Related Items

Morphing Contact Representations of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Deformations of plane graphs
• A note on optimal area algorithms for upward drawings of binary trees
• How to morph tilings injectively
• The efficient certification of knottedness and Thurston norm
• Morphing Planar Graph Drawings Efficiently
• The computational complexity of knot and link problems
• Morphing Planar Graph Drawings Optimally
• How to Morph Planar Graph Drawings
• Morphing Planar Graph Drawings with a Polynomial Number of Steps
• Deformations of Plane Rectilinear Complexes