Sciweavers

1327 search results - page 57 / 266
» Path following algorithm for the graph matching problem
Sort
View
SIMVIS
2004
15 years 3 months ago
3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
Angela Brennecke, Tobias Isenberg
EMMCVPR
2007
Springer
15 years 8 months ago
Shape Classification Based on Skeleton Path Similarity
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
Xingwei Yang, Xiang Bai, Deguang Yu, Longin Jan La...
GIS
2009
ACM
16 years 2 months ago
Map Matching and Uncertainty: an Algorithm and Real-World Experiments
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...
SAC
2010
ACM
15 years 8 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
IPL
2010
158views more  IPL 2010»
14 years 11 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán