Sciweavers

Share
CORR
2002
Springer

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

8 years 10 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
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, graphs--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 drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed ones) 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. Article Type Communicated by Submitted Revised regular paper G. Liotta January 2004 July ...
Matthew Dickerson, David Eppstein, Michael T. Good
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
Comments (0)
books