The length of digital curves

• Autorzy: Klette R. , Yip B.
• Języki publikacji: EN

Abstrakty

EN

The aper discusses one of the elementary subjects in image analysis: how to measure the lenght of a digital curve. A digital curve in the plane is defined to be a cycle given either as an alternating sequence of vertices and edges, or an alternating sequence of edges and squares. The paper reports about two lenght estimators, one based on the partition of a frontier of a simply-connected isothetic polygon into digital straight segments, and one based on calculating the minimum-lenght polygon within an open boundary of a simply-connected isothetic polygon. Both techniques are known to be implementations of covergent estimators of the perimeter of bounded, polygonal or smooth convex sets in the euclidean plane. For each technique a linear-time algorithm is specified, and both algorithms are compared with respect to convergence speed and number of generated segments. The experiments show convergent behavior also for perimeters of non-convex bounded subsets of the euclidean plane.

Słowa kluczowe

EN

digital geometry; digital curves; lenght of digital curves; curve lenght estimation; multigrid convergence; experimental evaluation; digital straight segment approximation; digitization; minimum--lenght polygon calculation

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2000
• Tom: Vol. 9, No. 3
• Strony: 673--703
• Opis fizyczny: Bibliogr. 33 poz.

Twórcy

autor

Klette R.

autor

Yip B.

• CITR Tamaki, University of Auckland, Tamaki Campus, Building 731, Auckland, New Zeland