- We will send in 10–14 business days.
/images/books/13456408/9783958261464.jpg)
- Author: Andre Löffler
- Publisher: Würzburg University Press
- Year: 2021
- Pages: 172
- ISBN-10: 3958261469
- ISBN-13: 9783958261464
- Format: 17 x 24.4 x 0.9 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 23d.14:23:38
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Andre Löffler
- Publisher: Würzburg University Press
- Year: 2021
- Pages: 172
- ISBN-10: 3958261469
- ISBN-13: 9783958261464
- Format: 17 x 24.4 x 0.9 cm, minkšti viršeliai
- Language: English English
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.
Reviews