5356 search results - page 320 / 1072 » Adventures in time and space |
165
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
183
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
172
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
171
click to vote
WSCG
2004
15 years 8 months ago
2004
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
174
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...