[1] 陈超.圆与椭圆对多边形裁剪算法的研究[D].哈尔滨:哈尔滨工程大学, 2008.
[2] 杜玉越.圆形窗口的凸多边形裁剪[J].计算机应用与软件,1995,12(4):48-53.
[3] 姚涵珍,宋鹏,张国安.圆形窗口裁剪算法的研究与实践[J].计算机辅助设计与图形学学报,1992,4(3):14-20.
[4] 刘勇奎.圆形及椭圆形裁剪窗口[J].计算机工程与设计,1994,4:33-37.
[5] Wikipedia.Voronoi Diagram.Tampa:MediaWiki, 2013[EB/OL].[2013-11-01].http:[C]//en.wikipedia.org/wiki/Voronoi_diagram.
[6] 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. |