Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Usefulness of Angle-Sweep over Line-Sweep
Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
| Hi-index | 0.00 |
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size buckets so that the maximum number of points in a bucket is minimized. Suppose at most (n/b) + Δ points lies in each bucket in an optimal solution. We present algorithms whose time complexities depend on b and Δ. No prior knowledge of Δ is necessary for our algorithms. For the one-dimensional problem, we give a deterministic algorithm that achieves a running time of O(b4Δ2 log n + n). For the two-dimensional problem, we present a Monte-Carlo algorithm that runs in sub-quadratic time for certain values of b and Δ. The previous algorithms, by Asano and Tokuyama [1], searched the entire parameterized space and required Ω(n2) time in the worst case even for constant values of b and Δ.