Constrained Graph Layouts
Vertices on the Outer Face and on the Integer Grid
Seiten
2021
Würzburg University Press (Verlag)
978-3-95826-146-4 (ISBN)
Würzburg University Press (Verlag)
978-3-95826-146-4 (ISBN)
Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing.
In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid.
For the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic.
For the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.
In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid.
For the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic.
For the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.
geboren 1987, M. Sc. (Informatik, Universität Würzburg)
| Erscheinungsdatum | 04.03.2022 |
|---|---|
| Verlagsort | Würzburg |
| Sprache | englisch |
| Maße | 170 x 240 mm |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Mathematik / Informatik ► Mathematik ► Geometrie / Topologie | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| Schlagworte | Algorithmische Geometrie • Algorithmus • Graphenzeichnen • Kombinatorik • Komplexität • Konvexe Zeichnungen • Planare Graphen • Polyeder |
| ISBN-10 | 3-95826-146-9 / 3958261469 |
| ISBN-13 | 978-3-95826-146-4 / 9783958261464 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Gekrümmte Kurven und Flächen
Buch | Softcover (2024)
De Gruyter (Verlag)
CHF 76,90
Nielsen Methods, Covering Spaces, and Hyperbolic Groups
Buch | Softcover (2024)
De Gruyter (Verlag)
CHF 153,90
