Sciweavers

57 search results - page 4 / 12
» Directed graphs and rectangular layouts
Sort
View
COMGEO
2004
ACM
13 years 9 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
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
VIP
2003
13 years 11 months ago
On the Structural Algorithm of Filtering Graphs for Layout
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
Xiaodi Huang, Wei Lai
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
14 years 4 months ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
IV
2007
IEEE
164views Visualization» more  IV 2007»
14 years 4 months ago
Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
Pierre-Yves Koenig, Guy Melançon, Charles B...