133 search results - page 5 / 27 » On the distinct distances determined by a planar point set |
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
SMI
2006
IEEE
15 years 5 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
CCCG
2003
15 years 1 months ago
2003
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper, we present a method for finding the closed form solutions to the problem of determining the pose of a camera with respect to a given set of parallel lines in 3D spac...
DCC
2001
IEEE
15 years 11 months ago
2001
IEEE
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...