Bentley, Jon Louis; Weide, Bruce W.; Yao, Andrew C. Optimal expected-time algorithms for closest point problems. (English) Zbl 0441.68077 ACM Trans. Math. Softw. 6, 563-580 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 46 Documents MSC: 68R99 Discrete mathematics in relation to computer science 68R10 Graph theory (including graph drawing) in computer science 68P10 Searching and sorting Keywords:computational geometry; closest point problems; minimum spanning trees; nearest neighbor searching; optimal algorithms; Voronoi diagrams PDF BibTeX XML Cite \textit{J. L. Bentley} et al., ACM Trans. Math. Softw. 6, 563--580 (1980; Zbl 0441.68077) Full Text: DOI Link