Constrained Graph Layouts

Editora:

Würzburg University Press

Código:

491_9783958261464

Vendido e entregue por Um Livro

De: R$ 0,00Por: R$ 308,62ou 3X de R$ 102,87

Comprar

Sinopse
Características

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 Cauchys rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.

Veja mais

Calcule o valor do frete e prazo de entrega para a sua região