Optimal morphs of convex drawings
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Abstract: We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case.
Recommendations
Cited in
(19)- Planar and toroidal morphs made easier
- Optimal morphs of planar orthogonal drawings. II
- On morphing 1-planar drawings
- scientific article; zbMATH DE number 1830718 (Why is no real title available?)
- Morphing Contact Representations of Graphs
- How to morph planar graph drawings
- Planar and Toroidal Morphs Made Easier
- Convexity-increasing morphs of planar graphs
- Upward planar morphs
- Upward planar morphs
- How to morph a tree on a small grid
- Convexity-increasing morphs of planar graphs
- Morphing triangle contact representations of triangulations
- scientific article; zbMATH DE number 7692360 (Why is no real title available?)
- Unit-length rectangular drawings of graphs
- Morphing rectangular duals
- Unit-length rectangular drawings of graphs
- Morphing graph drawings in the presence of point obstacles
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs
This page was built for publication: Optimal morphs of convex drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368681)
