Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge

Authors:
Emilio Di Giacomo;Giuseppe Liotta;Francesco Trotta
Affiliations:
Università degli Studi di Perugia, Dipartimento di Ingegneria Elettronica e dell’Informazione, Perugia, Italy;Università degli Studi di Perugia, Dipartimento di Ingegneria Elettronica e dell’Informazione, Perugia, Italy;Università degli Studi di Perugia, Dipartimento di Ingegneria Elettronica e dell’Informazione, Perugia, Italy
Venue:
Algorithmica
Year:
2010

Citing 0
Cited 3

The hamiltonian augmentation problem and its applications to graph drawing

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Orthogeodesic point-set embedding of trees

GD'11 Proceedings of the 19th international conference on Graph Drawing
Point-Set embeddability of 2-colored trees

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hamiltonicity, book embeddability, and point-set embeddability of planar graphs are strictly related concepts. We exploit the interplay between these notions to describe colored sets of points and to design polynomial-time algorithms to embed k-colored planar graphs on these sets such that the resulting drawings have $\mathcal{O}(k)$bends per edge.