5019 search results - page 17 / 1004 » On the Reflexivity of Point Sets |
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
SIAMCOMP
1998
13 years 8 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
PR
2008
13 years 8 months ago
2008
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
PAMI
2010
13 years 3 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
GD
2007
Springer
14 years 2 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...