Pole Dancing: 3D Morphs for Tree Drawings
DOI10.7155/JGAA.00503zbMATH Open1419.05141OpenAlexW2972820771WikidataQ127292554 ScholiaQ127292554MaRDI QIDQ5233136FDOQ5233136
Alessandra Tappini, Pilar Cano, Prosenjit Bose, Elena Arseneva, Fabrizio Frati, Anthony D'Angelo, Stefan Langerman, Vida Dujmović
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
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?)
- Title not available (Why is that?)
- 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
- 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
- Locked and unlocked polygonal chains in three dimensions
- The efficient certification of knottedness and Thurston norm
- Morphing Schnyder drawings of planar triangulations
- How to Morph Planar Graph Drawings
- Polygonal chains cannot lock in 4D
Cited In (8)
- On morphing 1-planar drawings
- Morphing rectangular duals
- Morphing tree drawings in a small 3D grid
- Equilateral Spherical Drawings of Planar Cayley Graphs
- 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
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)
