Simultaneous graph embedding with bends and circular arcs

Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
2009 Computational geometry  
A simultaneous embedding of two vertex-labeled planar graphs on n vertices is possible if there exists a labeled point set of size n such that each of the graphs can be realized on that point set without crossings. 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
more » ... f a path and an outerplanar graph. All embedding algorithms run in O (n) time.
doi:10.1016/j.comgeo.2008.05.003 fatcat:6utifpbxjrbyfhqzqa2tpiudam