Pole dancing: 3D morphs for tree drawings
From MaRDI portal
Publication:5233136
Recommendations
Cites work
- scientific article; zbMATH DE number 2107976 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A note on optimal area algorithms for upward drawings of binary trees
- Deformations of Plane Rectilinear Complexes
- Deformations of plane graphs
- How to morph planar graph drawings
- How to morph tilings injectively
- Locked and unlocked polygonal chains in three dimensions
- Morphing Planar Graph Drawings Efficiently
- Morphing Planar Graph Drawings Optimally
- Morphing planar graph drawings with a polynomial number of steps
- Polygonal chains cannot lock in 4D
- Straightening polygonal arcs and convexifying polygonal cycles
- The computational complexity of knot and link problems
- The efficient certification of knottedness and Thurston norm
- Tree drawings revisited
Cited in
(8)- On morphing 1-planar drawings
- Morphing tree drawings in a small 3D grid
- Pole dancing: 3D morphs for tree drawings
- Morphing tree drawings in a small 3D grid
- Morphing rectangular duals
- Equilateral spherical drawings of planar Cayley graphs
- How to morph a tree on a small grid
- Morphing triangle contact representations of triangulations
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)