Visualization of structural information: automatic drawing of compound digraphs

Sugiyama, K.; Misue, Kazuo

doi:10.1109/21.108304

Cited by 165 publications

(130 citation statements)

References 9 publications

Supporting

Mentioning

129

Contrasting

Order By: Relevance

“…For these reasons we devised a new algorithm to produce clustered hierarchical drawings, as a planarization-oriented variation of [16]. In [21] an algorithm is proposed for the expansion/contraction of clusters of hierarchical drawings, building on [27]. Unfortunately it uses local layering for vertices, while global layering [25,26] is more suitable for our needs because it produces more compact drawings.…”

Section: The Algorithmsmentioning

confidence: 99%

Dynamic Traceroute Visualization at Multiple Abstraction Levels

et al. 2013

View full text Add to dashboard Cite

Abstract. We present a system, called TPLAY, for the visualization of the traceroutes performed by the Internet probes deployed by active measurement projects. These traceroutes are continuously executed towards selected Internet targets. TPLAY allows to look at traceroutes at different abstraction levels and to animate the evolution of traceroutes during a selected time interval. The system has been extensively tested on traceroutes performed by RIPE Atlas [22] Internet probes.

show abstract

Section: The Algorithmsmentioning

confidence: 99%

Dynamic Traceroute Visualization at Multiple Abstraction Levels

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Compound and clustered graphs are studied in [10,11,20,23]. Creating a graph clustering based on binary space partitions and using it to display large graphs was introduced by Duncan, Goodrich, and Kobourov [7].…”

Section: Visualization Of Large Graphsmentioning

confidence: 99%

A multi-dimensional approach to force-directed layouts of large graphs*1

Gajer

2004

International Journal of Production Economics

View full text Add to dashboard Cite

Abstract. We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often results in drawings that are "smoother" and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, efficient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a mid-range PC.

show abstract

“…The notation should be appropriate, intuitive, and easily understood to reduce the need to translate between external and internal representations. The structure should use canonical forms that activate recognizable 'readability rules' [45] by cueing appropriate kinds of inferences in the reader.…”

Section: The Use Of Diagramsmentioning

confidence: 99%

Bubble World--A Novel Visual Information Retrieval Technique

Berendonck¹

2002

PsycEXTRA Dataset

View full text Add to dashboard Cite

With the tremendous growth of published electronic information sources in the last decade and the unprecedented reliance on this information to succeed in day-to-day operations, comes the expectation of finding the right information at the right time. Sentential interfaces are currently the only viable solution for searching through large infospheres of unstructured information, however, the simplistic nature of their interaction model and lack of cognitive amplification they can provide severely limit the performance of the interface. Visual information retrieval systems are emerging as possible candidate replacements for the more traditional interfaces, but many lack the cognitive framework to support the knowledge crystallization process found to be essential in information retrieval. This work introduces a novel visual information retrieval technique crafted from two distinct design genres: (1) the cognitive strategies of the human mind to solve problems and (2) observed interaction patterns with existing information retrieval systems. Based on the cognitive and interaction framework developed in this research, a functional prototype information retrieval system, called Bubble World, has been created to demonstrate that significant performance gains can be achieved using this technique when compared to more traditional text-based interfaces. Bubble World does this by successfully transforming the internal mental representation of the information retrieval problem to an efficient external view, and then through visual cues, provides cognitive amplification at key stages of the information retrieval process. Additionally, Bubble World provides the interaction model and the mechanisms to incorporate complex search schemas into the retrieval process either manually or automatically through the use of predefined ontological models. Subject Terms Visual Information Retrieval, Cognitive Propositions, Design Corollaries, Ontology Models Report Classification unclassified Classification of this page unclassified Classification of Abstract unclassified Limitation of Abstract UU Number of Pages 174AFIT/GCS/ENG/02M-09

show abstract

Visualization of structural information: automatic drawing of compound digraphs

Cited by 165 publications

References 9 publications

Dynamic Traceroute Visualization at Multiple Abstraction Levels

Dynamic Traceroute Visualization at Multiple Abstraction Levels

A multi-dimensional approach to force-directed layouts of large graphs*1

Bubble World--A Novel Visual Information Retrieval Technique

Contact Info

Product

Resources

About