Simultaneous embedding of planar graphs with few bends

Authors:
Cesim Erten;Stephen G. Kobourov
Affiliations:
Department of Computer Science, University of Arizona;Department of Computer Science, University of Arizona
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 6
Cited 12

Arboricity and subgraph listing algorithms

SIAM Journal on Computing
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs

Journal of Algorithms
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient Planarity Testing

Journal of the ACM (JACM)
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse

INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
The geometric thickness of low degree graphs

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

Simultaneous graph embedding with bends and circular arcs

Computational Geometry: Theory and Applications
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Graph Drawing
Simultaneous graph embedding with bends and circular arcs

GD'06 Proceedings of the 14th international conference on Graph drawing
Embedding graphs simultaneously with fixed edges

GD'06 Proceedings of the 14th international conference on Graph drawing
Constrained simultaneous and near-simultaneous embeddings

GD'07 Proceedings of the 15th international conference on Graph drawing
Simultaneous geometric graph embeddings

GD'07 Proceedings of the 15th international conference on Graph drawing
Testing planarity of partially embedded graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Simultaneous graph embeddings with fixed edges

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Simultaneous embedding with two bends per edge in polynomial area

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Delta-confluent drawings

GD'05 Proceedings of the 13th international conference on Graph Drawing
Two trees which are self–intersecting when drawn simultaneously

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

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2)× O(n2) grid, with at most three bends per edge, where n is the number of vertices. For the case when the input graphs are both trees, only one bend per edge is required. We also describe an O(n) time algorithm for simultaneous embedding with fixed-edges for tree-path pairs on the O(n)× O(n2) grid with at most one bend per tree-edge and no bends along path edges.