Aurenhammer F.Voronoi diagrams—a survey of a fundamental geometric data structure[J]. ACM Computing Surveys (CSUR), 1991, 23(3): 345-405.
[7]
Bentley J L,Weide B W,Yao A C.Optimal expected-time algorithms for closest point problems[J].ACM Transactions on Mathematical Software (TOMS),1980,6(4): 563-580.
[8]
Shamos M I,Hoey D.Closest-point problems[C]//Foundations of Computer Science.16th Annual Symposium on.[S.l.]:IEEE, 1975:151-162.
[9]
Arya S, Mount D M, Netanyahu N S, et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions[J]. Journal of the ACM (JACM), 1998, 45(6): 891-923.
[10]
Fortune S.Voronoi diagrams and delaunay triangulations[J]. Computing in Euclidean Geometry, 1992, 1: 193-233.
[11]
Fortune S. A sweepline algorithm for voronoi diagrams[J].Algorithmica, 1987, 2(1-4): 153-174.
