Computing radial drawings on the minimum number of circles

Authors:
Emilio Di Giacomo;Walter Didimo;Giuseppe Liotta;Henk Meijer
Affiliations:
Università degli Studi di Perugia, Perugia, Italy;Università degli Studi di Perugia, Perugia, Italy;Università degli Studi di Perugia, Perugia, Italy;School of Computing, Queen's University, Kingston, Ontario, Canada
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 5
Cited 1

Handbook of Graphs and Networks: From the Genome to the Internet

Handbook of Graphs and Networks: From the Genome to the Internet
Drawing Graphs on Two and Three Lines

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph Drawing Software

Graph Drawing Software
Curve-constrained drawings of planar graphs

Computational Geometry: Theory and Applications
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Computing a minimum-depth planar graph embedding in O(n4) time

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by using the minimum number of concentric circles. We assume that the edges are drawn as straight-line segments and that co-circular vertices can be adjacent. It is proven that the problem can be solved in polynomial time.