281 search results - page 2 / 57 » On Embedding a Graph on Two Sets of Points |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
JGAA
2006
13 years 5 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
ECCV
2004
Springer
14 years 7 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...