5019 search results - page 22 / 1004 » On the Reflexivity of Point Sets |
IPCO
2007
13 years 10 months ago
2007
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
ICCV
2003
IEEE
14 years 1 months ago
2003
IEEE
Multiple projections of a scene cannot be arbitrary, the allowed configurations being given by matching constraints. This paper presents new matching constraints on multiple proj...
CIAC
2006
Springer
14 years 5 days ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
JGAA
2006
13 years 8 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...