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

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

2002-12-17

arxiv.org/abs/cs/0212046v1

J. Graph Algorithms and Applications (special issue for GD'03) 9(1):31-52, 2005.

Computer Science

Computational Geometry

10 pages, 18 figures

Scientific paper

In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams 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 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.

Affiliated with

Also associated with

No associations

Rating

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259007