1348 search results - page 8 / 270 » Matching planar maps |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
WADS
2005
Springer
14 years 29 days ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
CGI
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper a computational model called dynamic medial axis (DMA) is proposed to describe the internal evolution of planar shapes. To define the DMA, a symbolic representation ...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper we present a novel approach to perform indoor self-localization using reference omnidirectional images. We only need one omnidirectional image of the whole scene ...