Results 1  10
of
32
Graph Drawing by HighDimensional Embedding
 In GD02, LNCS
, 2002
"... We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2D plane using PCA. Experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seco ..."
Abstract

Cited by 59 (10 self)
 Add to MetaCart
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2D plane using PCA. Experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.
On Spectral Graph Drawing
 Proc. 9th Inter. Computing and Combinatorics Conference (COCOON’03), LNCS 2697
, 2002
"... The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we e ..."
Abstract

Cited by 44 (10 self)
 Add to MetaCart
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties. We present a novel view of the spectral approach, which provides a direct link between eigenvectors and the aesthetic properties of the layout. In addition, we present a new formulation of the spectral drawing method with some aesthetic advantages. This formulation is accompanied by an aestheticallymotivated algorithm, which is much easier to understand and to implement than the standard numerical algorithms for computing eigenvectors.
Layout metrics for Euler Diagrams
 7th International Conference on Information Visualisation IEEE Computer
, 2003
"... We present an aesthetics based method for drawing Euler diagrams. Aesthetic layout metrics have been found to be useful in graph drawing algorithms, which use metrics motivated by aesthetic principles that aid user understanding of diagrams. We have taken a similar approach to Euler diagram drawing, ..."
Abstract

Cited by 26 (12 self)
 Add to MetaCart
We present an aesthetics based method for drawing Euler diagrams. Aesthetic layout metrics have been found to be useful in graph drawing algorithms, which use metrics motivated by aesthetic principles that aid user understanding of diagrams. We have taken a similar approach to Euler diagram drawing, and have defined a set of suitable metrics to be used within a hill climbing multicriteria optimiser to produce “good ” drawings. There are added difficulties when drawing Euler diagrams as they are made up of contours whose structural properties of intersection and containment must be preserved under any layout improvements. In this paper we describe our Java implementation of a pair of hill climbing variants to find good drawings, a set of metrics that measure aesthetics for good diagram layout, and issues concerning the choice of weightings for a useful combination of the metrics.
Map Layout Using Multicriteria Optimization
 Proc. of International Conference on Information Visualisation (IV04
, 2004
"... We describe a system to automatically generate metro maps using a multicriteria approach. We have implemented a hill climbing optimizer which uses a fitness score generated from a sum of several aesthetic metrics. This is used to move from the initial geographic layout of the map to a schematic layo ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We describe a system to automatically generate metro maps using a multicriteria approach. We have implemented a hill climbing optimizer which uses a fitness score generated from a sum of several aesthetic metrics. This is used to move from the initial geographic layout of the map to a schematic layout that is intended to aid travellers ’ navigation. We describe the software and show its application to a number of real world metro maps. Keywords metro map layout problem, public transport schematics, multicriteria optimization, graph drawing. 1.
Visualization of Labeled Data Using Linear Transformations
"... We present a novel family of datadriven linear transformations, aimed at visualizing multivariate data in a lowdimensional space in a way that optimally preserves the structure of the data. The wellstudied PCA and Fisher's LDA are shown to be special members in this family of transformations, and ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We present a novel family of datadriven linear transformations, aimed at visualizing multivariate data in a lowdimensional space in a way that optimally preserves the structure of the data. The wellstudied PCA and Fisher's LDA are shown to be special members in this family of transformations, and we demonstrate how to generalize these two methods such as to enhance their performance. Furthermore, our technique is the only one, to the best of our knowledge, that reflects in the resulting embedding both the data coordinates and pairwise similarities and/or dissimilarities between the data elements. Even more so, when information on the clustering (labeling) decomposition of the data is known, this information can be integrated in the linear transformation, resulting in embeddings that clearly show the separation between the clusters, as well as their intrastructure. All this make our technique very flexible and powerful, and let us cope with kinds of data that other techniques fail to describe properly.
DigCoLa: Directed graph layout through constrained energy minimization
 IEEE Symposium on Information Visualization, Infovis’05, 2005
"... We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance forcedirected placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP — such as emphasis of symmetrie ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance forcedirected placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP — such as emphasis of symmetries and preservation of proximity relations — are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with lowdimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.
Drawing graphs by eigenvectors: Theory and practice
 Computers and Mathematics with Applications
, 2005
"... Abstract. The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties from different points of view. We also suggest a novel algorithm for calculating spectral layouts resulting in an extremely fast computation by optimizing the layout within a small vector space.
Combining Hierarchy and Energy for Drawing Directed Graphs
 IEEE Trans. Visualization and Computer Graphics
, 2003
"... We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique onedimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique onedimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can be applied without change to cyclic or acyclic digraphs, and even to graphs containing both directed and undirected edges. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.
Consistent Layout for Thematic Software Maps
, 2008
"... Software visualizations can provide a concise overview of a complex software system. Unfortunately, since software has no physical shape, there is no “natural ” mapping of software to a twodimensional space. As a consequence most visualizations tend to use a layout in which position and distance ha ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Software visualizations can provide a concise overview of a complex software system. Unfortunately, since software has no physical shape, there is no “natural ” mapping of software to a twodimensional space. As a consequence most visualizations tend to use a layout in which position and distance have no meaning, and consequently layout typical diverges from one visualization to another. We propose a consistent layout for software maps in which the position of a software artifact reflects its vocabulary, and distance corresponds to similarity of vocabulary. We use Latent Semantic Indexing (LSI) to map software artifacts to a vector space, and then use Multidimensional Scaling (MDS) to map this vector space down to two dimensions. The resulting consistent layout allows us to develop a variety of thematic software maps that express very different aspects of software while making it easy to compare them. The approach is especially suitable for comparing views of evolving software, since the vocabulary of software artifacts tends to be stable over time.