Sciweavers

638 search results - page 21 / 128
» Track Layouts of Graphs
Sort
View
INFOVIS
1997
IEEE
15 years 1 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner
GD
1995
Springer
15 years 1 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
TSMC
1998
109views more  TSMC 1998»
14 years 9 months ago
Using graph parsing for automatic graph drawing
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
Carolyn McCreary, Richard Chapman, Fwu-Shan Shieh
ICIP
2005
IEEE
15 years 11 months ago
Object tracking based on morphological elastic graph matching
This paper presents a novel method for real-time tracking of objects in video sequences. Tracking is performed using the so-called Morphological Elastic Graph Matching algorithm. ...
Georgios N. Stamou, Nikos Nikolaidis, Ioannis Pita...
GD
2004
Springer
15 years 3 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani