Results 1  10
of
26
ThreeDimensional Orthogonal Graph Drawing
, 2000
"... vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . ..."
Abstract

Cited by 33 (13 self)
 Add to MetaCart
vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii List of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiv I Orthogonal Graph Drawing 1 1
A MaxentStress Model for Graph Layout
"... In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an in ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial allpairs shortest path calculation. A number of fast approximation algorithms have been proposed. While they work well for some graphs, the results are less satisfactory on graphs of intrinsically high dimension, because nodes overlap unnecessarily. We propose a solution, called the maxentstress model, which applies the principle of maximum entropy to cope with the extra degrees of freedom. We describe a forceaugmented stress majorization algorithm that solves the maxentstress model. Numerical results show that the algorithm scales well, and provides acceptable layouts for large, nonrigid graphs. This also has potential applications to scalable algorithms for statistical multidimensional scaling (MDS) with variable distances.
Drawing planar graphs symmetrically, III: Oneconnected planar graphs
 ALGORITHMICA
, 2006
"... Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. This paper discusses symmetric drawings of oneconnected planar graphs. More specifically, we discuss planar (geometric) automorphisms, that is, automorphisms of a graph G that can b ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
(Show Context)
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. This paper discusses symmetric drawings of oneconnected planar graphs. More specifically, we discuss planar (geometric) automorphisms, that is, automorphisms of a graph G that can be represented as symmetries of a planar drawing of G. Finding planar automorphisms is the first and most difficult step in constructing planar symmetric drawings of graphs. The problem of determining whether a given graph has a nontrivial geometric automorphism is NPcomplete for general graphs. The two previous papers in this series have discussed the problem of drawing planar graphs with a maximum number of symmetries, for the restricted cases where the graph is triconnected and biconnected. This paper extends the previous results to cover planar graphs that are oneconnected. We present a linear time algorithm for drawing oneconnected planar graphs with a maximum number of symmetries.
A new forcedirected graph drawing method based on edgeedge repulsion
 In Proc. of the 9th Int. Conf. on Inf. Vis
, 2005
"... ..."
On Maximum Symmetric Subgraphs
 Proc. of Graph Drawing 2000, Lecture Notes in Computer Science
, 2001
"... Let G be an nnode graph. We address the problem of computing a maximum symmetric graph H from G by deleting nodes, deleting edges, and contracting edges. This NPcomplete problem arises naturally from the objective of drawing G as symmetrically as possible. We show that its tractability for the spe ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Let G be an nnode graph. We address the problem of computing a maximum symmetric graph H from G by deleting nodes, deleting edges, and contracting edges. This NPcomplete problem arises naturally from the objective of drawing G as symmetrically as possible. We show that its tractability for the special cases of G being a plane graph, an ordered tree, and an unordered tree, depends on the type of operations used to obtain H from G. Moreover, we give an O(log n)approximation algorithm for the intractable case that H is obtained from a tree G by contracting edges. As a byproduct, we give an O(log n)approximation algorithm for an NPcomplete editdistance problem.
A linear time algorithm for constructing maximally symmetric straightline drawings of planar graphs
 Proc. of Graph Drawing 2004
, 2005
"... Abstract Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we need two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our a ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Abstract Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we need two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straightline drawings of triconnected planar graphs in linear time. Previously known algorithms run in quadratic time. We show that an algorithm of Fontet can be used to find an embedding in the plane with the maximum number of symmetries, and present a new algorithm for finding a straight line drawing that achieves that maximum. Both algorithms run in linear time.
Crossing Minimization for Symmetries
 Proc. of ISAAC 2002, Lecture Notes in Computer Science
, 2002
"... We consider the problem of drawing a graph with a given symmetry such that the number of edge crossings is minimal. We show that this problem is NPhard, even if the order of orbits around the rotation center or along the reection axis is fixed. Nevertheless, there is a linear time algorithm to test ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We consider the problem of drawing a graph with a given symmetry such that the number of edge crossings is minimal. We show that this problem is NPhard, even if the order of orbits around the rotation center or along the reection axis is fixed. Nevertheless, there is a linear time algorithm to test planarity and to construct a planar embedding if possible. Finally, we devise an O(m log m) algorithm for computing a crossing minimal drawing if interorbit edges may not cross orbits, showing in particular that intraorbit edges do not contribute to the NPhardness of the crossing minimization problem for symmetries.
Shamsehtrees: Providing hierarchical context for nodes of interest
 In Proceedings of Bridges 2009: Mathematics, Music, Art, Architecture, and Culture
, 2009
"... Visualizations of hierarchical data usually focus on conveying structure. However, with really large hierarchies, layouts tend to become overcrowded, making it difficult to see details about specific nodes. In contrast, ShamsehTrees focus on layouts centered on a node of interest, provide interactiv ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Visualizations of hierarchical data usually focus on conveying structure. However, with really large hierarchies, layouts tend to become overcrowded, making it difficult to see details about specific nodes. In contrast, ShamsehTrees focus on layouts centered on a node of interest, provide interactive nested layouts that were inspired by artistic and natural floral patterns, and make use of the natural symmetries in phyllotactic patterns. Instead of emphasizing overall tree structure, these layouts are created to make the most space available for the node of interest. The basic layout is comprised of nested circles that are centered on the node of interest. After selecting a new node of interest, the resizing and repositioning of nodes is animated as they transition to the new layout. Figure 1: Left: ShamsehTree, symmetric representation of the hierarchical context of the node of interest. Right: Traditional design of Shamseh, a circular shaped Persian Floral Pattern. 1
On Nearly Symmetric Drawings of Graphs
"... We propose a forcedirected approach for drawing graphs in a nearly symmetric fashion. Our algorithm is built upon recent theoretical results on maximum symmetric subgraphs. Knowing the sequence of edge contractions sufficient for turning an asymmetric graph into a symmetric subgraph, our approach i ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We propose a forcedirected approach for drawing graphs in a nearly symmetric fashion. Our algorithm is built upon recent theoretical results on maximum symmetric subgraphs. Knowing the sequence of edge contractions sufficient for turning an asymmetric graph into a symmetric subgraph, our approach in symmetric drawing begins by drawing a graph's maximum symmetric subgraph using a forcedirected method first; then the contracted edges are reinserted back into the drawing. Considering symmetry as the underlying aesthetic criterion, our algorithm provides better drawings than the conventional spring algorithms, as our experimental results indicate.
Software comprehension  integrating program analysis and software visualization
 in 2nd Conf. on Software Engineering Research and Practise in Sweden
, 2002
"... Abstract — We advocate that successful software comprehension methods (and tools) need the synergy of lowlevel code analyses known from the field of compiler construction, highlevel analyses from the field of reengineering and software visualization techniques. We argue that each individual techn ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract — We advocate that successful software comprehension methods (and tools) need the synergy of lowlevel code analyses known from the field of compiler construction, highlevel analyses from the field of reengineering and software visualization techniques. We argue that each individual technique would be either not goal directed or too shallow (or both). After a thorough stateoftheart analysis and a problem discussion, we propose an approach to integration. I.