An elementary algorithm for digital arc segmentation
暂无分享,去创建一个
[1] Peter Damaschke. The linear time recognition of digital arcs , 1995, Pattern Recognit. Lett..
[2] Harold Davenport,et al. The Higher Arithmetic: An Introduction to the Theory of Numbers , 1952 .
[3] Joëlle Vittone. Caractérisation et reconnaissance de droites et de plans en géométrie discrète , 1999 .
[4] Laure Tougne,et al. Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature , 1999, DGCI.
[5] Jovisa D. Zunic,et al. On the Maximal Number of Edges of Convex Digital Polygons Included into an m x m -Grid , 1995, J. Comb. Theory, Ser. A.
[6] Isabelle Debled-Rennesson,et al. Detection of the discrete convexity of polyominoes , 2000, Discret. Appl. Math..
[7] Isabelle Debled-Rennesson,et al. Etude et reconnaissance des droites et plans discrets , 1995 .
[8] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[9] Nimrod Megiddo,et al. Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.
[10] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[11] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[12] Alfred M. Bruckstein,et al. On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[13] Chul E. Kim,et al. Digital disks and a digital compactness measure , 1984, STOC '84.
[14] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[15] Anne Vialard. Geometrical parameters extraction from discrete paths , 1996, DGCI.
[16] Steve Fisk. Separating Point Sets by Circles, and the Recognition of Digital Disks , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[17] Peter L. Hammer,et al. Discrete Applied Mathematics , 1993 .
[18] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[19] Natasa Sladoje,et al. Ellipses Estimation from their Digitization , 1997, DGCI.
[20] Akira Nakamura,et al. Digital circles , 1984, Comput. Vis. Graph. Image Process..
[21] Azriel Rosenfeld,et al. Convex Digital Solids , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[22] Nahum Kiryati,et al. Digital representation schemes for 3d curves , 1997, Pattern Recognit..
[23] Chul E. Kim. On the Cellular Convexity of Complexes , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] V. A. Kovalevsky. New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.
[25] Isabelle Debled-Rennesson,et al. A Linear Algorithm for Segmentation of Digital Curves , 1995, Int. J. Pattern Recognit. Artif. Intell..
[26] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..
[27] Laure Tougne,et al. Discrete Curvature Based on Osculating Circle Estimation , 2001, IWVF.
[28] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[29] AZRIEL ROSENFELD,et al. Digital Straight Line Segments , 1974, IEEE Transactions on Computers.
[30] Chul E. Kim,et al. Digital Disks , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[31] Marcel Worring,et al. Digitized Circular Arcs: Characterization and Parameter Estimation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[32] K. Voss. Discrete Images, Objects, and Functions in Zn , 1993 .