The linear time recognition of digital arcs

DOI10.1016/0167-8655(95)00127-3zbMath0837.68125OpenAlexW1981747019MaRDI QIDQ4840363

Peter Damaschke

Publication date: 16 April 1996

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(95)00127-3

zbMATH Keywords

linear-time algorithmdigital circleslinear time recognition algorithmelliptical arcsdigitized circular arcs

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Related Items (13)

Topological relations between separating circles ⋮ An optimal parallel algorithm for digital curve segmentation ⋮ Determining digital circularity using integer intervals ⋮ An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search ⋮ Graphical Techniques for Detecting Lines with the Hough Transform ⋮ Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties ⋮ Separability and Tight Enclosure of Point Sets ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ An Elementary Algorithm for Digital Arc Segmentation ⋮ Measure of circularity for parts of digital boundaries and its fast computation ⋮ On Three Constrained Versions of the Digital Circular Arc Recognition Problem ⋮ An elementary algorithm for digital arc segmentation

This page was built for publication: The linear time recognition of digital arcs