On Morphing 1-Planar Drawings
Computational Geometry
2021-05-28 v1
Abstract
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of topology-preserving morphs for pairs of non-planar graph drawings. We make a step towards this problem by showing that a topology-preserving morph always exists for drawings of a meaningful family of -planar graphs. While our proof is constructive, the vertices may follow trajectories of unbounded complexity.
Cite
@article{arxiv.2105.13040,
title = {On Morphing 1-Planar Drawings},
author = {Patrizio Angelini and Michael A. Bekos and Fabrizio Montecchiani and Maximilian Pfister},
journal= {arXiv preprint arXiv:2105.13040},
year = {2021}
}
Comments
To appear in Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021)