Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs

Dwyer, Tim; Mears, Christopher; Morgan, Kerri; Niven, Todd; Marriott, Kim; Wallace, Mark

doi:10.1109/pacificvis.2014.46

Cited by 16 publications

(21 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…where m and n are modules and N are their neighbour sets. This is almost the same as nedges(m, n) in [5], except as a positive score rather than a negative penalty. See Dwyer et al [5] for detailed background and definitions.…”

Section: Improved Power Graph Decompositionmentioning

confidence: 77%

“…This is almost the same as nedges(m, n) in [5], except as a positive score rather than a negative penalty. See Dwyer et al [5] for detailed background and definitions. Note that m cannot be fully 'absorbed' when merging with n if either N(m) ⊂ N(n), or m is a leaf of the tree i.e.…”

Section: Improved Power Graph Decompositionmentioning

confidence: 77%

“…Here we outline our power graph generation algorithm, which includes one improvement from the one used by Bach et al [1], originally developed by Dwyer et al [5]. The algorithm works by also taking advantage of the fact that the hierarchy of power groups can be represented as a tree, with vertices as the leaves.…”

Section: Improved Power Graph Decompositionmentioning

confidence: 99%

See 2 more Smart Citations

Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization

Zheng

Pawar

Goodman

2021

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Fig. 1. An illustration of our solution to the issues with the algorithm of Bach et al. [1], using their original example graph (Fig. 2 in [1]).From left to right: a conventional node-link diagram with vertices arranged around a circle; its power graph decomposition, where edges are compressed by grouping similar nodes together; our novel equivalent routing graph, where the nested structure of groups is represented by a directed tree; the resulting confluent drawing, where original edges are threaded through the routing graph to form bundled junctions.Abstract-Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and short-circuit problems, and solve both by modifying the routing graph to retain the hierarchical structure of power groups. We also classify the exact type of confluent drawings that the algorithm can produce as 'power-confluent', and prove that it is a subclass of the previously studied 'strict confluent' drawing. A description and source code of our implementation is also provided, which additionally includes an improved method for power graph construction.

show abstract

Section: Improved Power Graph Decompositionmentioning

confidence: 77%

Section: Improved Power Graph Decompositionmentioning

confidence: 77%

See 1 more Smart Citation

Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization

Zheng

Pawar

Goodman

2021

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…Our decision to use scale-free graphs is motivated by the fact that scale-freeness is often observed in graphs stemming from important application areas like biology and the social sciences. To obtain a grouping for each of these graphs an edge-compression heuristic [21] was applied. Thus, our full corpus consists of 940 flat-graphs, 100 Rome graphs, and the corresponding 1040 grouped graphs, called power-graphs.…”

Section: Discussionmentioning

confidence: 99%

High-Quality Ultra-Compact Grid Layout of Grouped Networks

Yoghourdjian

Dwyer

Gange

et al. 2016

IEEE Trans. Visual. Comput. Graphics

Self Cite

View full text Add to dashboard Cite

Fig. 1: Grid systems in typographic layout, UI design and an example of our proposed grid layout for a power-graph. With graphic designers playing an increasing role in the design of user interfaces for phone, tablet and desktop operating systems, this traditional grid-based design aesthetic is becoming more popular in these media. A case in point is Microsoft's "Modern" interface which seeks to unify app-design across devices. This resurgence of the grid-design aesthetic in new media leads us to re-examine some of the aesthetic assumptions that have been made in designing layout methods for network diagrams.Abstract-Prior research into network layout has focused on fast heuristic techniques for layout of large networks, or complex multi-stage pipelines for higher quality layout of small graphs. Improvements to these pipeline techniques, especially for orthogonal-style layout, are difficult and practical results have been slight in recent years. Yet, as discussed in this paper, there remain significant issues in the quality of the layouts produced by these techniques, even for quite small networks. This is especially true when layout with additional grouping constraints is required. The first contribution of this paper is to investigate an ultra-compact, grid-like network layout aesthetic that is motivated by the grid arrangements that are used almost universally by designers in typographical layout. Since the time when these heuristic and pipeline-based graph-layout methods were conceived, generic technologies (MIP, CP and SAT) for solving combinatorial and mixed-integer optimization problems have improved massively. The second contribution of this paper is to reassess whether these techniques can be used for high-quality layout of small graphs. While they are fast enough for graphs of up to 50 nodes we found these methods do not scale up. Our third contribution is a large-neighborhood search meta-heuristic approach that is scalable to larger networks.

show abstract

“…To further reduce the complexity of bundled edges, a module‐based edge bundling method was proposed by Dwyer et al . [DMM*14]. A similar cluster‐based approach was later considered by Sun et al .…”

Section: Related Workmentioning

confidence: 99%

VisFM: Visual Analysis of Image Feature Matchings

Baciu

2018

Computer Graphics Forum

View full text Add to dashboard Cite

Feature matching is the most basic and pervasive problem in computer vision and it has become a primary component in big data analytics. Many tools have been developed for extracting and matching features in video streams and image frames. However, one of the most basic tools, that is, a tool for simply visualizing matched features for the comparison and evaluation of computer vision algorithms is not generally available, especially when dealing with a large number of matching lines. We introduce VisFM, an integrated visual analysis system for comprehending and exploring image feature matchings. VisFM presents a matching view with an intuitive line bundling to provide useful insights regarding the quality of matched features. VisFM is capable of showing a summarization of the features and matchings through group view to assist domain experts in observing the feature matching patterns from multiple perspectives. VisFM incorporates a series of interactions for exploring the feature data. We demonstrate the visual efficacy of VisFM by applying it to three scenarios. An informal expert feedback, conducted by our collaborator in computer vision, demonstrates how VisFM can be used for comparing and analysing feature matchings when the goal is to improve an image retrieval algorithm.

show abstract

Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs

Cited by 16 publications

References 19 publications

Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization

Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization

High-Quality Ultra-Compact Grid Layout of Grouped Networks

VisFM: Visual Analysis of Image Feature Matchings

Contact Info

Product

Resources

About