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

Simple item page
dc.creatorDickerson, Matthew
dc.creatorEppstein, David
dc.creatorGoodrich, Michael T.
dc.creatorMeng, Jeremy
dc.date2002-12-17
dc.date.accessioned2026-07-07T06:22:19Z
dc.date.available2026-07-07T06:22:19Z
dc.descriptionIn 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.
dc.description10 pages, 18 figures
dc.identifierhttps://arxiv.org/abs/cs/0212046
dc.identifierhttp://arxiv.org/abs/cs/0212046
dc.identifierJ. Graph Algorithms and Applications (special issue for GD'03) 9(1):31-52, 2005.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/95876
dc.subjectComputational Geometry
dc.subjectSoftware Engineering
dc.subjectD.2.2
dc.titleConfluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
dc.typetext

Files

Collections

arXiv