Sciweavers

5889 search results - page 31 / 1178
» Graph Layout Problems
Sort
View
IWPC
2005
IEEE
14 years 3 months ago
Clustering Software Artifacts Based on Frequent Common Changes
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsyst...
Dirk Beyer, Andreas Noack
INFOVIS
1997
IEEE
14 years 2 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
14 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»
13 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
ICDAR
2005
IEEE
14 years 3 months ago
A Statistical Learning Approach To Document Image Analysis
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
Kevin Laven, Scott Leishman, Sam T. Roweis