Simultaneous Graph Embedding with Bends and Circular Arcs

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.

• Type: Conference
• Year: 2006
• Where: GD
• Authors: Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
• Keywords: Computer Graphics, Curvilinear Simultaneous Embeddings, GD 2006, Planar Graph, Simultaneous Embeddings