Simultaneous graph embedding with bends and circular arcs

Authors:
Justin Cappos;Alejandro Estrella-Balderrama;J. Joseph Fowler;Stephen G. Kobourov
Affiliations:
Department of Computer Science, University of Arizona;Department of Computer Science, University of Arizona;Department of Computer Science, University of Arizona;Department of Computer Science, University of Arizona
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 4
Cited 3

On embedding an outer-planar graph in a point set

Computational Geometry: Theory and Applications
Characterization of unlabeled level planar trees

GD'06 Proceedings of the 14th 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
Simultaneous embedding of planar graphs with few bends

GD'04 Proceedings of the 12th international conference on Graph Drawing

Simultaneous graph embedding with bends and circular arcs

Computational Geometry: Theory and Applications
Computing upward topological book embeddings of upward planar digraphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Matched drawings of planar graphs

GD'07 Proceedings of the 15th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar graph. We also show how to use star-shaped levels to find 2-bends per path edge simultaneous embeddings of a path and an outerplanar graph. All embedding algorithms run in O(n) time.