| |
|
| Artikel-Nr.: 858A-9783958261464 Herst.-Nr.: 9783958261464 EAN/GTIN: 9783958261464 |
| |
|
| | |
| 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. Weitere Informationen: | | Author: | Andre Löffler | Verlag: | Würzburg University Press | Sprache: | eng |
|
| | |
| | | |
| Weitere Suchbegriffe: Algorithmische Geometrie; Graphenzeichnen; Konvexe Zeichnungen; Kombinatorik; Komplexität, Komplexität, Planare Graphen, Algorithmus, Kombinatorik, Konvexe Zeichnungen, Polyeder, Algorithmische Geometrie, Graphenzeichnen |
| | |
| |