Drawing Directed Graphs Clockwise

Pich, Christian (2010) Drawing Directed Graphs Clockwise. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 369-380(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_35).

Full text not available from this repository.

Abstract

We present a method for clockwise drawings of directed cyclic graphs. It is based on the eigenvalue decomposition of a skew-symmetric matrix associated with the graph and draws edges clockwise around the center instead of downwards, as in the traditional hierarchical drawing style. The method does not require preprocessing for cycle removal or layering, which often involves computationally hard problems. We describe an efficient algorithm which produces optimal solutions, and we present some application examples.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-11805-0_35
Classifications: P Styles > P.999 Others
M Methods > M.500 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1099

Actions (login required)

View Item View Item