文章基本信息

标题：Optimal Morphs of Convex Drawings
本地全文：下载
作者：Patrizio Angelini ; Giordano Da Lozzo ; Fabrizio Frati 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2015
卷号：34
页码：126-140
DOI：10.4230/LIPIcs.SOCG.2015.126
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Convex Drawings; Planar Graphs; Morphing; Geometric Representations