Graphsplatting: visualizing graphs as continuous fields

Liere, Robert van; Leeuw, Wim de

doi:10.1109/tvcg.2003.1196007

Cited by 63 publications

(48 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whole bundles can be drawn as compact shapes whose structure is emphasized by shaded cushions [32]. Graph splatting visualizes node-link diagrams as continuous scalar fields using color and/or height maps [35,16].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Skeleton-Based Edge Bundling for Graph Visualization

Ersoy

Hurter

Paulovich

et al. 2011

IEEE Trans. Visual. Comput. Graphics

148

172

View full text Add to dashboard Cite

Abstract-In this paper, we present a novel approach for constructing bundled layouts of general graphs. As layout cues for bundles, we use medial axes, or skeletons, of edges which are similar in terms of position information. We combine edge clustering, distance fields, and 2D skeletonization to construct progressively bundled layouts for general graphs by iteratively attracting edges towards the centerlines of level sets of their distance fields. Apart from clustering, our entire pipeline is image-based with an efficient implementation in graphics hardware. Besides speed and implementation simplicity, our method allows explicit control of the emphasis on structure of the bundled layout, i.e. the creation of strongly branching (organic-like) or smooth bundles. We demonstrate our method on several large real-world graphs.Index Terms-Graph layouts, edge bundles, image-based information visualization.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Classical visualization metaphors for general graphs include node-link diagrams [17], matrix plots [34], and graph splatting [35]. For specific types of graphs, such as hierarchies (trees), additional methods exist such as treemaps.…”

Section: Introductionmentioning

confidence: 99%

Skeleton-Based Edge Bundling for Graph Visualization

Ersoy

Hurter

Paulovich

et al. 2011

IEEE Trans. Visual. Comput. Graphics

148

172

View full text Add to dashboard Cite

show abstract

“…Bundles can be drawn as compact shapes whose structure is emphasized by shaded cushions [55,47]. Graph splatting visualizes node-link diagrams as smooth scalar fields using color and/or height maps [59,32]. To explore crowded overlapping bundles, semantic lenses can be used [29].…”

Section: Bundled Edge Graph Visualizationmentioning

confidence: 99%

Bundled Visualization of DynamicGraph and Trail Data

Hurter

Ersoy

Fabrikant

et al. 2014

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We present two techniques for simplified visualization of such datasets using edge bundles. The first technique uses an efficient image-based bundling method to create smoothly changing bundles from streaming graphs. The second technique adds edge-correspondence data atop of any static bundling algorithm, and is best suited for graph sequences. We show how these techniques can produce simplified visualizations of streaming and sequence graphs. Next, we show how several temporal attributes can be added atop of our dynamic graphs. We illustrate our techniques with datasets from aircraft monitoring, software engineering, and eye-tracking of static and dynamic scenes.

show abstract

“…Our method is inspired from the GraphSplatting technique introduced by van Liere et al in [21]. In that work, the authors represent a graph as a 2D continuous scalar field and calculate a splat field.…”

Section: Edge Splattingmentioning

confidence: 99%