Computational geometry: an introduction
Computational geometry: an introduction
Digital circles with non-lattice point centers
The Visual Computer: International Journal of Computer Graphics
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)
Digital disks and a digital compactness measure
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A linear incremental algorithm for naive and standard digital lines and planes recognition
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
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
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
Accurate curvature estimation along digital contours with maximal digital circular arcs
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
O(n 3logn) time complexity for the optimal consensus set computation for 4-Connected Digital Circles
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Topological relations between separating circles
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, the problem of digital circular arcs recognition is investigated in a new way. The main contribution is a simple and linear-time algorithm for solving three subproblems: online recognition of digital circular arcs coming from the digitization of a disk having either a given radius, a boundary that is incident to a given point, or a center that is on a given straight line. Solving these subproblems is interesting in itself, but also for the recognition of digital circular arcs. The proposed algorithm can be iteratively used for this problem. Moreover, since the algorithm is online, it provides a way to segment digital curves.