102291 search results - page 19804 / 20459 » Computing |
162
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
153
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
182
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
204
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
147
click to vote
JCDL
2010
ACM
15 years 10 months ago
2010
ACM
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...