Computing Radial Drawings on the Minimum Number of Circles

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2004) Computing Radial Drawings on the Minimum Number of Circles. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 251-261(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_26).

Full text not available from this repository.

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. Research supported in part by ldquoProgetto ALINWEB: Algoritmica per Internet e per il Webrdquo, MIUR Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale, and by NSERC.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-31843-9_26
Classifications: P Styles > P.720 Straight-line
P Styles > P.540 Planar
P Styles > P.120 Circular
URI: http://gdea.informatik.uni-koeln.de/id/eprint/592

Actions (login required)

View Item View Item