5889 search results - page 31 / 1178 » Graph Layout Problems |
127
click to vote
IWPC
2005
IEEE
15 years 10 months ago
2005
IEEE
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...
165
click to vote
INFOVIS
1997
IEEE
15 years 8 months ago
1997
IEEE
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 ...
151
click to vote
GD
1995
Springer
15 years 8 months ago
1995
Springer
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...
119
click to vote
TSMC
1998
15 years 4 months ago
1998
: 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...
135
click to vote
ICDAR
2005
IEEE
15 years 10 months ago
2005
IEEE
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...