5019 search results - page 15 / 1004 » On the Reflexivity of Point Sets |
CCCG
2007
13 years 10 months ago
2007
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
COMBINATORICS
2006
13 years 8 months ago
2006
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
IJCGA
2007
13 years 8 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
GBRPR
2005
Springer
14 years 1 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...