On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
The linear time recognition of digital arcs
Pattern Recognition Letters
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometrical parameters extraction from discrete paths
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Ellipses Estimation from their Digitization
DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
Number-theoretic interpretation and construction of a digital circle
Discrete Applied Mathematics
Digitization scheme that assures faithful reconstruction of plane figures
Pattern Recognition
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
Digital Circularity and Its Applications
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
What Does Digital Straightness Tell about Digital Convexity?
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
On three constrained versions of the digital circular arc recognition problem
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Ellipse detection with elemental subsets
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Detection of circular arcs in a digital image using chord and sagitta properties
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Unsupervised, fast and precise recognition of digital arcs in noisy images
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part I
Analytical description of digital circles
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Distance between separating circles and points
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Optimal consensus set for annulus fitting
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Recognition of digital hyperplanes and level layers with forbidden points
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Arc segmentation in linear time
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Determining Digital Circularity Using Integer Intervals
Journal of Mathematical Imaging and Vision
Generalized perpendicular bisector and circumcenter
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Topological relations between separating circles
Discrete Applied Mathematics
On covering a digital disc with concentric circles in Z2
Theoretical Computer Science
Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
This paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details, are given (the latter by providing pseudo-code for major steps of the algorithm). After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arcs.