COMPGEOM
2009
ACM
13 years 2 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 2 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 2 months ago
2009
ACM
Computed tomography(CT), especially since the introduction of helical CT, provides excellent visualization of the internal organs of the body. As a result, CT is used routinely in...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
COMPGEOM
2009
ACM
13 years 11 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 ...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...