004 Datenverarbeitung; Informatik
Refine
Has Fulltext
- yes (1)
Is part of the Bibliography
- yes (1)
Year of publication
- 2021 (1)
Document Type
- Doctoral Thesis (1)
Language
- English (1) (remove)
Keywords
- Algorithmische Geometrie (1)
- Algorithmus (1)
- Graphenzeichnen (1)
- Kombinatorik (1)
- Komplexität (1)
- Konvexe Zeichnungen (1)
- Planare Graphen (1)
- Polyeder (1)
Institute
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.