论文信息 - A Fast Convex Hull Algorithm - 字舞流文

A Fast Convex Hull Algorithm

Selim G. Akl | Godfried T. Toussaint | S. Akl | G. Toussaint

[1] Jack Koplowitz,et al. A More Efficient Convex Hull Algorithm , 1978, Inf. Process. Lett..

[2] Kenneth R. Anderson,et al. A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1978, Inf. Process. Lett..

[3] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[4] Peter M. Will,et al. Determining the Three-Dimensional Convex Hull of a Polyhedron , 1976, IBM J. Res. Dev..

[5] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Ray A. Jarvis,et al. On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[8] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[9] Richard Hacker,et al. Certification of Algorithm 112: Position of point relative to polygon , 1962, Commun. ACM.

[10] M. Shimrat. Algorithm 112: Position of point relative to polygon , 1962, CACM.