Pole dancing: 3D morphs for tree drawings
DOI10.7155/JGAA.00503zbMATH Open1419.05141OpenAlexW2972820771WikidataQ127292554 ScholiaQ127292554MaRDI QIDQ5233136FDOQ5233136
Authors: Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmović, Fabrizio Frati, Stefan Langerman, Alessandra Tappini 
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00503
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- A note on optimal area algorithms for upward drawings of binary trees
- Morphing Planar Graph Drawings Optimally
- The computational complexity of knot and link problems
- Title not available (Why is that?)
- Morphing Planar Graph Drawings Efficiently
- Morphing planar graph drawings with a polynomial number of steps
- Deformations of Plane Rectilinear Complexes
- Deformations of plane graphs
- Straightening polygonal arcs and convexifying polygonal cycles
- How to morph tilings injectively
- Tree drawings revisited
- Locked and unlocked polygonal chains in three dimensions
- The efficient certification of knottedness and Thurston norm
- How to morph planar graph drawings
- Polygonal chains cannot lock in 4D
Cited In (9)
- Pole dancing: 3D morphs for tree drawings
- On morphing 1-planar drawings
- Morphing rectangular duals
- Morphing tree drawings in a small 3D grid
- Morphing triangle contact representations of triangulations
- Morphing planar graph drawings through 3D
- Morphing tree drawings in a small 3D grid
- How to morph a tree on a small grid
- Equilateral spherical drawings of planar Cayley graphs
This page was built for publication: Pole dancing: 3D morphs for tree drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233136)
