License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.126
URN: urn:nbn:de:0030-drops-51333
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5133/
Go to the corresponding LIPIcs Volume Portal

Angelini, Patrizio ; Da Lozzo, Giordano ; Frati, Fabrizio ; Lubiw, Anna ; Patrignani, Maurizio ; Roselli, Vincenzo

Optimal Morphs of Convex Drawings

pdf-format:
50.pdf (0.6 MB)

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.

BibTeX - Entry

@InProceedings{angelini_et_al:LIPIcs:2015:5133,
  author =	{Patrizio Angelini and Giordano Da Lozzo and Fabrizio Frati and Anna Lubiw and Maurizio Patrignani and Vincenzo Roselli},
  title =	{{Optimal Morphs of Convex Drawings}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{126--140},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5133},
  URN =		{urn:nbn:de:0030-drops-51333},
  doi =		{10.4230/LIPIcs.SOCG.2015.126},
  annote =	{Keywords: Convex Drawings, Planar Graphs, Morphing, Geometric Representations}
}

Keywords: Convex Drawings, Planar Graphs, Morphing, Geometric Representations
Collection: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 12.06.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI