COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
GBRPR
2005
Springer
14 years 5 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
ESA
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
ISVC
2009
Springer
14 years 6 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 ...
ICIP
2008
IEEE
15 years 1 months ago
2008
IEEE
We address two-dimensional shape-based classification, considering shapes described by arbitrary sets of unlabeled points, or landmarks. This is relevant in practice because, in m...
ECCV
1998
Springer
15 years 1 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...