Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>
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.
| Autorius: | Andre Löffler |
| Leidėjas: | Würzburg University Press |
| Išleidimo metai: | 2021 |
| Knygos puslapių skaičius: | 172 |
| ISBN-10: | 3958261469 |
| ISBN-13: | 9783958261464 |
| Formatas: | 240 x 170 x 11 mm. Knyga minkštu viršeliu |
| Kalba: | Anglų |
Parašykite atsiliepimą apie „Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid“
