Sciweavers

COMPGEOM
2009
ACM
13 years 8 months ago
Lower bounds for weak epsilon-nets and stair-convexity
Boris Bukh, Jirí Matousek, Gabriel Nivasch
COMPGEOM
2009
ACM
13 years 8 months ago
Minimum Manhattan network is NP-complete
Francis Y. L. Chin, Zeyu Guo, He Sun
COMPGEOM
2009
ACM
13 years 8 months ago
Geometric tomography: a limited-view approach for computed tomography
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...
Peter B. Noël, Jinhui Xu, Kenneth R. Hoffmann...
COMPGEOM
2009
ACM
14 years 3 months ago
Kinetic spanners in Rd
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...
Mohammad Ali Abam, Mark de Berg
COMPGEOM
2009
ACM
14 years 3 months ago
Visibility maps of realistic terrains have linear smoothed complexity
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 ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
COMPGEOM
2009
ACM
14 years 3 months ago
The scale axis transform
Joachim Giesen, Balint Miklos, Mark Pauly, Camille...
COMPGEOM
2009
ACM
14 years 3 months ago
The scale axis picture show
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...
Joachim Giesen, Balint Miklos, Mark Pauly, Camille...
COMPGEOM
2009
ACM
14 years 3 months ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani
COMPGEOM
2009
ACM
14 years 5 months ago
A general approach for cache-oblivious range reporting and approximate range counting
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 ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
COMPGEOM
2009
ACM
14 years 5 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
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...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh