Time- and storage-efficient implementation of an optimal planar convex hull algorithm
暂无分享,去创建一个
[1] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..
[2] William F. Eddy,et al. A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.
[3] William F. Eddy. Algorithm 523: CONVEX, A New Convex Hull Algorithm for Planar Sets [Z] , 1977, TOMS.
[4] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[5] Godfried T. Toussaint,et al. Computational Geometric Problems in Pattern Recognition , 1982 .
[6] Ira Pohl,et al. A sorting problem and its complexity , 1972, CACM.
[7] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[8] Selim G. Akl,et al. EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS. , 1979 .