Algorithms for testing convexity of digital polygons
暂无分享,去创建一个
[1] Jack Sklansky,et al. Minimum-Perimeter Polygons of Digitized Silhouettes , 1972, IEEE Transactions on Computers.
[2] Denis Rutovitz,et al. An Algorithm for In-Line Generation of a Convex Cover , 1975 .
[3] Bruce J. Schachter,et al. Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.
[4] Luigi P. Cordella,et al. Concavity Point Detection by Iterative Arrays , 1974, Comput. Graph. Image Process..
[5] L. Hodes. Discrete Approximation of Continuous Convex Blobs , 1970 .
[6] Ernesto Bribiesca,et al. How to describe pure form and how to measure differences in shapes using shape numbers , 1980, Pattern Recognit..
[7] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .
[8] E. V. Krishnamurthy,et al. On the compactness of subsets of digital pictures , 1978 .
[9] Theodosios Pavlidis,et al. Structural pattern recognition , 1977 .
[10] I. J. Schoenberg. An isoperimetric inequality for closed curves convex in even-dimensional euclidean spaces , 1954 .
[11] Jack Sklansky,et al. Recognition of convex blobs , 1970, Pattern Recognit..
[12] Luigi P. Cordella,et al. Parallel Detection of Concavities in Cellular Blobs , 1976, IEEE Transactions on Computers.
[13] Reinhard Klette. Parallel operations on binary images , 1980 .
[14] J. Sklansky. On filling cellular concavities , 1975 .
[15] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.