On the recognition of digital circles in linear time

DOI10.1016/0925-7721(93)90025-2zbMath0793.68196OpenAlexW2076015041MaRDI QIDQ1803274

P. W. Sauer

Publication date: 29 June 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90025-2

zbMATH Keywords

circleFreeman codedigitization

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Topological relations between separating circles ⋮ Determining digital circularity using integer intervals ⋮ Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ A unified scheme for detecting fundamental curves in binary edge images ⋮ On Three Constrained Versions of the Digital Circular Arc Recognition Problem

Cites Work

• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A bibliography on digital and computational convexity (1961-1988)
• On the Chain Code of a Line
• Digital Straight Line Segments
• Unnamed Item
• Unnamed Item

This page was built for publication: On the recognition of digital circles in linear time