Topological Morphing of Planar Graphs

Authors:
Patrizio Angelini;Pier Francesco Cortese;Giuseppe Battista;Maurizio Patrignani
Affiliations:
Università Roma Tre,;Università Roma Tre,;Università Roma Tre,;Università Roma Tre,
Venue:
Graph Drawing
Year:
2009

Citing 8
Cited 0

On-Line Planarity Testing

SIAM Journal on Computing
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
How to morph tilings injectively

Journal of Computational and Applied Mathematics
Faster and simpler algorithm for sorting signed permutations by reversals

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computing Orthogonal Drawings with the Minimum Number of Bends

IEEE Transactions on Computers
Morphing orthogonal planar graph drawings

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Advances on sorting by reversals

Discrete Applied Mathematics
Morphing planar graphs while preserving edge directions

GD'05 Proceedings of the 13th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study how two planar embeddings of the same biconnected graph can be morphed one into the other while minimizing the number of elementary changes.