Skip to the end of the images gallery Navigation umschalten
Skip to the beginning of the images gallery Navigation umschalten
Constrained Graph Layouts
Vertices on the Outer Face and on the Integer Grid
Paperback
172 Seiten
ISBN-13: 9783958261464
Verlag: Würzburg University Press
Erscheinungsdatum: 14.01.2021
Sprache: Englisch
Farbe: Ja
32,90 €
inkl. MwSt. / portofrei
Ihr eigenes Buch!
Werden Sie Autor*in mit BoD und erfüllen Sie sich den Traum vom eigenen Buch und E-Book.
Mehr erfahrenConstraining 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.
Eigene Bewertung schreiben
Es sind momentan noch keine Pressestimmen vorhanden.