Graph Drawing Contest Report

Duncan, Christian A.; Gutwenger, Carsten; Nachmanson, Lev; Sander, Georg

doi:10.1007/978-3-642-11805-0_48

Cited by 8 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The technique relies on an information visualization approach that highlights the relevance of multiple points of view (layers) and interaction. Earlier versions of this approach were used in the analysis of social groups [20] and bioinformatics [21], [22]. Here, we will briefly discuss two examples, the first one corresponds to a group structure where the hull and node layers perfectly represent the actual group relationships and a second one where the complexity is higher and it is convenient to use piecharts, zone hulls and surfaces for a better understanding of the data.…”

Section: Resultsmentioning

confidence: 99%

Visualization of Intersecting Groups Based on Hypergraphs

Santamaría

Therón

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYHypergraphs drawn in the subset standard are useful to represent group relationships using topographic characteristics such as intersection, exclusion and enclosing. However, they present cluttering when dealing with a moderately high number of nodes (more than 20) and large hyperedges (connecting more than 10 nodes, with three or more overlapping nodes). At this complexity level, a study of the visual encoding of hypergraphs is required in order to reduce cluttering and increase the understanding of larger sets. Here we present a graph model and a visual design that help in the visualization of group relationships represented by hypergraphs. This is done by the use of superimposed visualization layers with different abstraction levels and the help of interaction and navigation through the display.

show abstract

Section: Resultsmentioning

confidence: 99%

Visualization of Intersecting Groups Based on Hypergraphs

Santamaría

Therón

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…In general, they do not deal with self loops and multiple edges as occurs in pyramids. The most prominent results can be seen in [6]. We present a novel algorithm for correctly visualizing graph pyramids preserving the geometry and the topology of the original image.…”

Section: Introductionmentioning

confidence: 99%

Delineating Homology Generators in Graph Pyramids

Iglesias

Ion²,

Kropatsch³

et al. 2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Computation of homology generators using a graph pyramid can significantly increase performance, compared to the classical methods. First results in 2D exist and show the advantages of the method. Generators are computed on the upper level of a graph pyramid. Toplevel graphs may contain self loops and multiple edges, as a side product of the contraction process. Using straight lines to draw these edges would not show the full information: self loops disappear, parallel edges collapse. This paper presents a novel algorithm for correctly visualizing graph pyramids, including multiple edges and self loops which preserves the geometry and the topology of the original image. New insights about the top-down delineation of homology generators in graph pyramids are given.

show abstract

WITHDRAWN: Decay centrality-based distance vector similarity (DIVES) metric for complex networks

Meghanathan

2017

Journal of King Saud University - Computer and Information Scie

View full text Add to dashboard Cite

Graph Drawing Contest Report

Abstract: Abstract. This report describes the 16 th Annual Graph Drawing Contest, held in conjunction with the 2009 Graph Drawing Symposium in Chicago, USA. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology.

Cited by 8 publications

References 4 publications

Visualization of Intersecting Groups Based on Hypergraphs

Visualization of Intersecting Groups Based on Hypergraphs

Delineating Homology Generators in Graph Pyramids

WITHDRAWN: Decay centrality-based distance vector similarity (DIVES) metric for complex networks

Contact Info

Product

Resources

About