On the recognition of digital circles in linear time
Computational Geometry: Theory and Applications
The linear time recognition of digital arcs
Pattern Recognition Letters
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Shape Similarity Measure Based on Correspondence of Visual Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital disks and a digital compactness measure
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
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'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.00 |
A linear algorithm based on a discrete geometry approach is proposed for the detection of digital arcs and digital circles using a new representation of them. It is introduced by inspiring from the work of Latecki [1]. By utilizing this representation, we transform the problem of digital arc detection into a problem of digital straight line recognition. We then develop a linear method for arc segmentation of digital curves.