On the recognition of digital circles in linear time
type: Item
instance of: scholarly article
title: On the recognition of digital circles in linear time
zbMATH Open document ID: 0793.68196
DOI: 10.1016/0925-7721(93)90025-2
published in: Computational Geometry
publication date: 1993-06-29T00:00:00Z
review text: The author proves that it is possible to decide if a set of \(N\) points of a grid comes from the perfect digitization of a circle in \(O(N)\) steps.
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 220609
zbMATH Keywords: Freeman code
zbMATH Keywords: digitization
zbMATH Keywords: circle
author: P. W. Sauer
reviewed by: Jean-Thierry Lapresté
MaRDI profile type: Publication
full work available at URL: 0925-7721(93)90025-2
OpenAlex ID: W2076015041
cites work: Digital Straight Line Segments
cites work: On the Chain Code of a Line
cites work: Q3995770
cites work: Q3999208
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: A bibliography on digital and computational convexity (1961-1988)
Recommended article: The linear time recognition of digital arcs
Recommended article: Linear-time recognition of circular-arc graphs
Recommended article: A simpler linear-time recognition of circular-arc graphs
Recommended article: A Simpler Linear-Time Recognition of Circular-Arc Graphs
Recommended article: On Three Constrained Versions of the Digital Circular Arc Recognition Problem
Recommended article: An efficient randomized algorithm for detecting circles
Recommended article: Measure of circularity for parts of digital boundaries and its fast computation
Recommended article: Recognizing circle graphs in polynomial time
Recommended article: Discrete Geometry for Computer Imagery
Recommended article: Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
description: scientific article; zbMATH DE number 220609