论文信息 - A fast algorithm for convex hull extraction in 2D images

A fast algorithm for convex hull extraction in 2D images

Abstract A fast algorithm for computing the convex hull of a set of distinct points or an arbitrarily shaped object in the Cartesian discrete plane is presented in this paper. A sequence of points is first extracted from the input image. These points form a non-self-intersecting polygon. Then, a cross-product rule is used to check the convexity of the polygon and compute the convex hull from it.

Qin-Zhong Ye

[1] Michael Ian Shamos,et al. Divide and Conquer for Linear Expected Time , 1978, Inf. Process. Lett..

[2] Q. Ye. The signed Euclidean distance transform and its applications , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[3] Denis Rutovitz,et al. An Algorithm for In-Line Generation of a Convex Cover , 1975 .

[4] 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..

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

[6] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[7] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .

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

[9] Selim G. Akl,et al. EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS. , 1979 .

[10] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[11] William F. Eddy,et al. A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.

[12] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.