Goodman Jacob E,0\'Rourke Joseph.Handbook of Discrete and Computational Geometry (2nd edition)[M],Boca Raton,FL,USA:Chapman & Hall/CRC,2004.
[2]
De Berg M,Kreveld M,Van Ovemnars M,et al.Computational Geometry:Algorithms and Applications (2nd Edition)[M].New York,USA; Springer-Verlag Inc,2000.
[3]
Fang Tsungpao,Piegl L A.Delaunay triangulation using a uniform grid[J].IEEE Computer Graphics and Applications,1993,13(3):36-47.
[4]
Shamos M I,Hoey D.Closest-point problems[C]//Proceedings 16th Annual Symposium on Foundations of Computer Science,New York,USA:IEEE Computer Society,1975; 151-162.
[5]
Franz Aurenhammer.Voronoi diagrams-A survey of a fundamental geometric data structure[J].ACM Computing Surveys,1991,23 (3):345-405.
[6]
Fortune S.A sweepline algorithm for Voronoi diagrams[J].Algorithmic,1987,2(1-4):153-174.
[7]
Guibas L J,Stolfi J S.Ruler,compass,and computer:The design and analysis of geometric algorithms[C]//Earnshaw R A (ed):Proceedings Theoretical Foundations of Computer Graphics and CAD,Berlin,German; New York,USA; Springer-Veralag,1988:111-165.
[8]
Yang Chenglei,Wang Jiaye,Meng Xiangsu.Upper bounds of the numbem of vertices and edges in outer Voronoi diagram of polygon[J].Journal of Computer Aided Design and Computer Graphics,2005,17(4):689-693.[杨承磊,汪嘉业,孟祥旭.多边形外部Voronoi网顶点和边数的上界[J].计算机辅助设计与网形学学报,2005,17(4):689-693].
