1397 search results - page 27 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
ISVC
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The ...
IUI
2012
ACM
12 years 4 months ago
2012
ACM
Numerous interaction techniques have been developed that make “virtual” pointing at targets in graphical user interfaces easier than analogous physical pointing tasks by invok...
CORR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...