共 24 条
[1]
Bentley, Shamos, Divide and conquer for linear expected time, Information Processing Lett., 7, 2, pp. 87-91, (1978)
[2]
Bentley, Weide, Yao, Optimal expected-time algorithms for closest-point problems, Allerton Conference, (1978)
[3]
Brown, Fast intersection of half-spaces, Rep. CMU-CS-78-129, (1978)
[4]
Brown, Geometric transforms for fast geometric algorithms, Thesis proposal at Carnegie-Mellon University, (1978)
[5]
Chand, Kapur, An algorithm for convex polytopes, Journal of the ACM, 17, 1, pp. 78-86, (1970)
[6]
Davis, McCullagh, Display and Analysis of Spatial Data, (1975)
[7]
Dodge, Euclidean Geometry and Transformations, (1972)
[8]
Drysdale, Lee, Generalized Voronoi diagram in the plane, Allerton Conference, (1978)
[9]
Eddy, A new convex hull algorithm for planar sets, ACM Transactions on Mathematical Software, 3, 4, pp. 398-403, (1977)
[10]
Graham, An efficient algorithm for determining the convex hull of a planar set, Information Processing Lett., 1, 4, pp. 132-133, (1972)