Optimal Morphs of Convex Drawings
classification
💻 cs.CG
cs.DMmath.CO
keywords
linearconvexdrawingsmorphoptimalalgorithmalongasymptotically
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.