Constrained Graph Layouts
% SALE
Constrained Graph Layouts
% SALE
% SALE
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.
Product details
- Type:
- Book
- Binding:
- Paperback
- Edition:
- 1
- Languages:
-
Original:
English
- Number of Pages:
-
172
- Publisher:
-
Würzburg University Press
- Publication Date:
-
2021-01-14
- ISBN / EAN:
- 9783958261464
- Weight:
-
339 g
- Dimensions:
-
17/24/1 cm
About the author
geboren 1987, M. Sc. (Informatik, Universität Würzburg)
Die gelieferte Auflage kann ggf. abweichen.
Currently sold out
Back in stock email
Add to Wishlist