Sciweavers

Share
COMPGEOM
2004
ACM
9 years 8 months ago
Separating point sets in polygonal environments
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...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
GBRPR
2005
Springer
9 years 8 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
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...
Tibério S. Caetano, Terry Caelli
ESA
2005
Springer
89views Algorithms» more  ESA 2005»
9 years 8 months ago
Experimental Study of Geometric t-Spanners
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...
Mohammad Farshi, Joachim Gudmundsson
ISVC
2009
Springer
9 years 9 months ago
Stochastic Optimization for Rigid Point Set Registration
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 ...
Chavdar Papazov, Darius Burschka
ICIP
2008
IEEE
10 years 4 months ago
Classification of unlabeled point sets using ANSIG
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...
José J. Rodrigues, João M. F. Xavier...
ECCV
1998
Springer
10 years 4 months ago
A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
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...
Raouf Benjemaa, Francis Schmitt
books