The Solid* toolset for software visual analytics of program structure and metrics comprehension: From research prototype to product

Reniers, Dennie; Voinea, Lucian; Ersoy, Ozan; Telea, Alexandru

doi:10.1016/j.scico.2012.05.002

Cited by 35 publications

(30 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first dataset contains 22 releases of Mozilla Firefox [26]. For each revision, we extracted the code hierarchy (folders and files), and also the so-called clones, or code duplicates, using the freely available clone detector SolidSDD [32,35]. Hence, for each revision, we obtain a compound hierarchy-andassociations graph where two files are linked by an edge if they share a code duplicate.…”

Section: Applicationsmentioning

confidence: 99%

Smooth bundling of large streaming and sequence graphs

Hurter

Ersoy

Telea

2013

2013 IEEE Pacific Visualization Symposium (PacificVis)

View full text Add to dashboard Cite

Dynamic graphs are increasingly pervasive in modern information systems. However, understanding how a graph changes in time is difficult. We present here two techniques for simplified visualization of dynamic graphs using edge bundles. The first technique uses a recent image-based graph bundling method to create smoothly changing bundles from streaming graphs. The second technique incorporates additional edge-correspondence data and is thereby suited to visualize discrete graph sequences. We illustrate our methods with examples from real-world large dynamic graph datasets.

show abstract

Section: Applicationsmentioning

confidence: 99%

Smooth bundling of large streaming and sequence graphs

Hurter

Ersoy

Telea

2013

2013 IEEE Pacific Visualization Symposium (PacificVis)

View full text Add to dashboard Cite

show abstract

“…HEB is very simple to implement and scales very well with the sizes of G and T . HEB has been used in many applications in software engineering [HvW08, CZH*08, DT14, RVET14], social sciences [KS10, JGH11], web ontologies [HdRFH12], text data [CC07], and life sciences [BSL*14, AP08, EBB*15]. HEB enhancements that simplify the bundled drawings [TE10] (Fig.…”

Section: Taxonomy Of Bundling Methodsmentioning

confidence: 99%

“…This is essential when edge directions carry semantics, such as when exploring a software system's call graph to assess modularity [DT14]. A simple way to do this is to color‐code edges using a source‐to‐destination categorical color gradient [Hol06, CZH*08, RVET14]. However, when edges of opposite directions co‐exist in a bundle, color mixing occurs, which makes the assessment of categorical colors very hard, let alone seeing how many edges of each direction the bundle has (see further Sec.…”

Section: Taxonomy Of Bundling Methodsmentioning

confidence: 99%

State of the Art in Edge and Trail Bundling Techniques

Lhuillier

Hurter

Telea

2017

Computer Graphics Forum

View full text Add to dashboard Cite

Bundling techniques provide a visual simplification of a graph drawing or trail set, by spatially grouping similar graph edges or trails. This way, the structure of the visualization becomes simpler and thereby easier to comprehend in terms of assessing relations that are encoded by such paths, such as finding groups of strongly interrelated nodes in a graph, finding connections between spatial regions on a map linked by a number of vehicle trails, or discerning the motion structure of a set of objects by analyzing their paths. In this state of the art report, we aim to improve the understanding of graph and trail bundling via the following main contributions. First, we propose a data‐based taxonomy that organizes bundling methods on the type of data they work on (graphs vs trails, which we refer to as paths). Based on a formal definition of path bundling, we propose a generic framework that describes the typical steps of all bundling algorithms in terms of high‐level operations and show how existing method classes implement these steps. Next, we propose a description of tasks that bundling aims to address. Finally, we provide a wide set of example applications of bundling techniques and relate these to the above‐mentioned taxonomies. Through these contributions, we aim to help both researchers and users to understand the bundling landscape as well as its technicalities.

show abstract

“…Treemaps are used to visualize hierarchical data in many domains including business [34], news [17] [13], and software visualization [15] [33]. After its first inception, different variations of the original treemap have been proposed [15].…”

Section: Related Workmentioning

confidence: 99%