120 search results - page 13 / 24 » On locally Delaunay geometric graphs |
137
click to vote
TASE
2010
IEEE
14 years 6 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
150
click to vote
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
113
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
104
click to vote
AGTIVE
2003
Springer
15 years 5 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
ICCV
1998
IEEE
16 years 1 months ago
1998
IEEE
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...