Any two equivalent planar orthogonal drawings of a disconnected graph with complexity n can be morphed into each other with O(n) linear morphs while preserving planarity, orthogonality, and linear complexity of intermediate drawings.
How to morph planar graph drawings.SIAM Journal on Computing , 46(2):824–852, 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal Morphs of Planar Orthogonal Drawings II
Any two equivalent planar orthogonal drawings of a disconnected graph with complexity n can be morphed into each other with O(n) linear morphs while preserving planarity, orthogonality, and linear complexity of intermediate drawings.