Practical use of Bucketing Techniques in Computational Geometry
Authors:
- T. AsanoTAT. Asano
- M. EdahiroMEM. Edahiro
- H. ImaiHIH. Imai
- M. IriMIM. Iri
- K. MurotaKMK. Murota
- 1 January 1985
- book chapter
- Published by Elsevier
- p. 153-195
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- A survey of heuristics for the weighted matching problemNetworks, 1983
- A fast heuristic based on spacefilling curves for minimum-weight matching in the planeInformation Processing Letters, 1983
- Heuristics for planar minimum-weight perfect metchingsNetworks, 1983
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Two-Dimensional Voronoi Diagrams in the
L
p
-MetricJournal of the ACM, 1980
- Quintary treesACM Transactions on Database Systems, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959