2000 character limit reached
Optimal Morphs of Convex Drawings
Published 31 Mar 2015 in cs.CG, cs.DM, and math.CO | (1503.09021v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
