arXiv
Open Access
2021
On Morphing 1-Planar Drawings
Patrizio Angelini
Michael A. Bekos
Fabrizio Montecchiani
Maximilian Pfister
Abstrak
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 $1$-planar graphs. While our proof is constructive, the vertices may follow trajectories of unbounded complexity.
Topik & Kata Kunci
Penulis (4)
P
Patrizio Angelini
M
Michael A. Bekos
F
Fabrizio Montecchiani
M
Maximilian Pfister
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2021
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓