Simultaneous Graph Embedding with Bends and Circular Arcs
| Autor: | J. Joseph Fowler, Justin Cappos, Stephen G. Kobourov, Alejandro Estrella-Balderrama |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Discrete mathematics
Book embedding Planar straight-line graph Graph embedding Computer Science::Computational Geometry law.invention Planar graph Combinatorics symbols.namesake law Outerplanar graph Line graph Graph minor symbols Topological graph theory ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS ComputingMethodologies_COMPUTERGRAPHICS MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Graph Drawing ISBN: 9783540709039 Graph Drawing |
| DOI: | 10.1007/978-3-540-70904-6_11 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|