Length estimation of digital curves

The paper details two linear-time algorithms, one for the partition of the boundary line of a digital region into digital straight segments, and one for calculating the minimum length polygon within an open boundary of a digital region. Both techniques allow the estimation of the length of digital curves or the perimeter of digital regions due to known multigrid convergence theorems. The algorithms are compared with respect to convergence speed and number of generated segments.

[1]  Fridrich Sloboda,et al.  The minimum perimeter polygon and its application , 1992, Theoretical Foundations of Computer Vision.

[2]  Vladimir Kovalevsky.  A Topological Method of Surface Representation , 1999, DGCI.

[3]  Reinhard Klette,et al.  Topology of grid continua , 1998, Optics & Photonics.

[4]  E. Creutzburg,et al.  Geometric methods for on-line recognition of digital straight-line segments , 1988 .

[5]  Vladimir Kovalevsky.  Applications of Digital Straight Segments to Economical Image Encoding , 1997, DGCI.

[6]  Reinhard Klette,et al.  Determination of the Convex Hull of a Finite Set of Planar Points Within Linear Time , 1981, J. Inf. Process. Cybern..

[7]  Vladimir A. Kovalevsky,et al.  Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[8]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[9]  John N. Tsitsiklis,et al.  Local Versus Nonlocal Computation of Length of Digitized Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  V. Kovalevsky,et al.  New definition and fast recognition of digital straight segments and arcs , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[11]  V. Kovalevsky,et al.  A New Concept for Digital Geometry , 1994 .

[12]  Z. Kulpa.  On the properties of discrete circles, rings, and disks , 1979 .

[13]  Azriel Rosenfeld,et al.  Advances in Digital and Computational Geometry , 1999 .

[14]  Willy Scherrer.  Ein Satz über Gitter und Volumen , 1922 .