@inproceedings{a0d7ac7ce9d54ba6a34c9a4340a67aae,
title = "Morphing Planar Graph Drawings Through 3D",
abstract = "In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an n-vertex planar graph, there exists a piecewise-linear crossing-free 3D morph with O(n 2) steps that transforms one drawing into the other. We also give some evidence why it is difficult to obtain a linear lower bound (which exists in 2D) for the number of steps of a crossing-free 3D morph.",
keywords = "3D graph drawing, Linear morph, Morphing steps",
author = "Kevin Buchin and Evans, {William S.} and Fabrizio Frati and Irina Kostitsyna and Maarten L{\"o}ffler and Tim Ophelders and Alexander Wolff",
year = "2023",
doi = "10.1007/978-3-031-23101-8_6",
language = "English",
isbn = "9783031231001",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "80--95",
editor = "Leszek Gasieniec",
booktitle = "SOFSEM 2023",
address = "Germany",
}