130
click to vote
COMPGEOM
15 years 9 months ago
2009 ACM 
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
133
click to vote
COMPGEOM
15 years 9 months ago
2009 ACM 
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
151
click to vote
COMPGEOM
15 years 9 months ago
2009 ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
121
click to vote
COMPGEOM
15 years 9 months ago
2009 ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
115
click to vote
COMPGEOM
15 years 9 months ago
2009 ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
|
Discrete Geometry