Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

Dickerson, Matthew and Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_1).

Full text not available from this repository.

Abstract

We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach allows us to draw, in a crossing-free manner, graph - such as software interaction diagrams - that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged together and drawn as "tracks" (similar to train tracks). Producing such confluent diagrams automatically from a graph with many crossings is quite challenging, however, so we offer two heuristic algorithms to test if a non-planar graph can be drawn efficiently in a confluent way. In addition, we identify several large classes of graphs that can be completely categorized as being either confluently drawable or confluently non-drawable.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-24595-7_1
Classifications: M Methods > M.700 Planarization-based
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/406

Actions (login required)

View Item View Item