Sciweavers

36 search results - page 3 / 8
» A multi-dimensional approach to force-directed layouts of la...
Sort
View
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 2 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
GD
2006
Springer
13 years 11 months ago
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
Ulrik Brandes, Christian Pich
APVIS
2001
13 years 8 months ago
Building Virtual Worlds with the Big-Bang Model
Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been develo...
Neville Churcher, Alan Creek
GD
2008
Springer
13 years 8 months ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril
GD
2008
Springer
13 years 8 months ago
Rapid Multipole Graph Drawing on the GPU
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
Apeksha Godiyal, Jared Hoberock, Michael Garland, ...