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 diagramsthat 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. © Springer-Verlag 2004.
CITATION STYLE
Dickerson, M., Eppstein, D., Goodrich, M. T., & Meng, J. Y. (2004). Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 1–12. https://doi.org/10.1007/978-3-540-24595-7_1
Mendeley helps you to discover research relevant for your work.