Techniques for using “buckets” to improve the efficiency of several computational-geometrical algorithms are described, together with examples illustrating the practical importance of the bucketing techniques. Specifically, they are applied to the problems of minimum-weight perfect matchings in the plane, two-dimensional Voronoi diagrams, point location and range search in the plane, and shortest paths in networks.
|Title of host publication||Machine Intelligence and Pattern Recognition|
|Number of pages||43|
|Publication status||Published - 1985 Jan 1|
|Name||Machine Intelligence and Pattern Recognition|
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Artificial Intelligence