20 search results - page 2 / 4 » Geometric Simultaneous Embeddings of a Graph and a Matching |
GD
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
ECCV
2004
Springer
14 years 6 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...
CVPR
2011
IEEE
13 years 24 days ago
2011
IEEE
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
CVPR
2010
IEEE
14 years 16 days ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...