Convex hulls of finite sets of points in two and three dimensions
暂无分享,去创建一个
[1] Daniel G. Bobrow,et al. Structure of a LISP system using two-level storage , 1967, CACM.
[2] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[3] Wilfred J. Hansen,et al. Compact list representation: definition, garbage collection, and system implementation , 1969, CACM.
[4] Donald R. Chand,et al. An Algorithm for Convex Polytopes , 1970, JACM.
[5] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[6] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[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] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[9] Alfred V. Aho,et al. The design and analysis of algorithms , 1974 .
[10] Earl D. Sacerdoti,et al. The Nonlinear Nature of Plans , 1975, IJCAI.
[11] H. T. Kung,et al. On Finding the Maxima of a Set of Vectors , 1975, JACM.
[12] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.
[13] M. Shamos. Problems in computational geometry , 1975 .