Developed Algorithm for Making Up Convex Hull Based on Binary Tree
暂无分享,去创建一个
[1] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[2] Convex hull calculation approach based on BST , 2018, 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).
[3] Milan Sonka,et al. Image Processing, Analysis and Machine Vision , 1993, Springer US.
[4] A. M. Andrew,et al. Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..
[5] Timothy M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions , 1996, Discret. Comput. Geom..
[6] David Pichardie,et al. Formalizing Convex Hull Algorithms , 2001, TPHOLs.
[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] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Rudolf Kruse,et al. Obtaining Shape Descriptors from a Concave Hull-Based Clustering Algorithm , 2016, IDA.
[10] Bernard Chazelle,et al. Shape distributions , 2002, TOGS.
[11] Thomas S. Huang,et al. Image processing , 1971 .
[12] A. Bykat,et al. Convex Hull of a Finite Set of Points in Two Dimensions , 1978, Inf. Process. Lett..
[13] E.E. Pissaloux,et al. Image Processing , 1994, Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing.
[14] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[15] Selim G. Akl,et al. A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..
[16] David G. Kirkpatrick,et al. The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..
[17] William F. Eddy,et al. A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.