
计算几何
|
265
计算几何
9.7 参考文献
Andrew, A. M.,
“
Another efficient algorithm for convex hulls in two dimensions,
”
Information Processing Letters
, 9(5): 216-219, 1979,
http://dx.doi.org/ 10.1016/0020-
0190(79)90072-3
.
Aurenhammer, F.,
“
Voronoi diagrams: A survey of a fundamental geometric data structure,
”
ACM Computing Surveys
, 23(3): 345-405, 1991,
http://dx.doi.org/ 10.1145/116873.116880
.
Eddy, W.,
“
A new convex hull algorithm for planar sets,
”
ACM Transactions on
Mathematical Software
, 3(4): 398-403, 1977,
http://dx.doi.org/ 10.1145/355759.355766
.
Fortune, S.,
“
A sweepline algorithm for Voronoi diagrams,
”
Proceedings of the 2nd Annual
Symposium on Computational ...