1274 search results - page 144 / 255 » The Geometry of Coin-Weighing Problems |
122
Voted
COMPGEOM
1997
ACM
15 years 5 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
99
Voted
COMPGEOM
1994
ACM
15 years 5 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
112
Voted
SIGGRAPH
1992
ACM
15 years 4 months ago
1992
ACM
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
110
Voted
COMPGEOM
1990
ACM
15 years 4 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
82
Voted
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...