Edge Routing with Fixed Node Positions

The Bobox project is a parallelization framework based on the idea of putting together a number of simple components to create a data processing, non-linear pipeline.The structure (the model) of the pipeline a directed graph, but with several specific properties. In order to display the pipeline in a debugger application that is a part of the framework, we have adapted some of the graph drawing algorithms to leverage the specific properties and challenges found in Bobox model visualization.

show abstract

“…Drawing of edges can be either handled like in the original algorithm, or the rerouting algorithm [4] can be used.…”

Section: Modification Of the Algorithmmentioning

confidence: 99%

“…Now, we can either add dummy vertices instead of potential crossings to get a planar graph or handle the non-planar edges separately (for example, draw them later using the rerouting algorithm [4]). …”

Section: Inputmentioning

confidence: 99%

Bobox Model Visualization

Dokulil

Katreniaková

2010

2010 14th International Conference Information Visualisation

View full text Add to dashboard Cite

show abstract

“…This supports poly-line and Bezier curve edge routing. An algorithm that draws only the edges with fixed node positions and does not make any use of the layered structure is provided in [7]. It starts by drawing the edge as a direct line between the source node and the destination node and then re-routes the line away from the nodes that intersect with the line.…”

Section: Related Workmentioning

confidence: 99%

From Tree to Graph - Experiments with E-Spring Algorithm

Kumar¹,

Zhang²,

Huang

2009

Visual Information Communication

View full text Add to dashboard Cite

Abstract. Graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. E-Spring Algorithm, derived from the popular spring embedder model, was proposed to eliminate node overlaps in the drawings of clustered directed acyclic graphs Gc. In this paper, we apply the E-Spring algorithm to general graphs by minimizing edge-node intersections. Initially, a tree structure is extracted from the original graph using the breadth-first search (BFS) algorithm. The extracted tree is then visualized without node overlaps using the E-Spring algorithm, and the remaining non-tree edges are appended to this visualization. A post-processing step that implements edge routing is performed on the obtained visualization to eliminate residual edge-node intersections. This method has been validated by visualizing eBay buyer-seller relationships and Graph Catalog benchmarking data.

show abstract

“…Tree edges connect nodes that are close to each other making them straight and short. Non-tree edges can connect any two nodes in the drawing and they follow a route that avoids other nodes [4]. This usually results in longer and much more complex polylines than in the case of tree-edges.…”

Section: Triangle Layoutmentioning

confidence: 99%

Visual Representation of Reifications in RDF Visualizer

Dokulil

Yaghob

Katreniaková

2009

2009 13th International Conference Information Visualisation

Self Cite

View full text Add to dashboard Cite

One family of visualization tools for the Semantic web are those that directly display the underlying RDF data. Most of them use the inherent graph structure of RDF data and present the user with some drawing of the graph. While it is usually sufficient to give the user with decent understanding of data, there are some features of RDF that could be used to improve the visualization, for instance the presence of reifications. While they can easily be displayed just like any other part of the RDF graph, their specific properties allow for more advanced processing.

show abstract

Edge Routing with Fixed Node Positions

Cited by 8 publications

References 5 publications

Bobox Model Visualization

Bobox Model Visualization

From Tree to Graph - Experiments with E-Spring Algorithm

Visual Representation of Reifications in RDF Visualizer

Contact Info

Product

Resources

About