153 search results - page 20 / 31 » Near-linear approximation algorithms for geometric hitting s... |
126
click to vote
CCCG
2009
15 years 4 months ago
2009
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...
156
Voted
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
119
Voted
TVCG
2010
15 years 2 months ago
2010
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
141
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
134
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...