Sciweavers

557 search results - page 7 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 5 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
108
Voted
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 3 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
CORR
2007
Springer
69views Education» more  CORR 2007»
14 years 11 months ago
Lossless Representation of Graphs using Distributions
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Mireille Boutin, Gregor Kemper
72
Voted
IV
2005
IEEE
81views Visualization» more  IV 2005»
15 years 4 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
VL
1999
IEEE
142views Visual Languages» more  VL 1999»
15 years 3 months ago
Visual Graphs
The formal treatment of visual languages is often based on graph representations. Since the matter of discourse is visual languages, it would be convenient if the formal manipulat...
Martin Erwig