On enclosing k points by a circle
Information Processing Letters
Shape Analysis and Classification: Theory and Practice
Shape Analysis and Classification: Theory and Practice
The Discrete Analytical Hyperspheres
IEEE Transactions on Visualization and Computer Graphics
Computing Constrained Minimum-Width Annuli of Point Sets
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
SIAM Journal on Computing
Optimal outlier removal in high-dimensional spaces
Journal of Computer and System Sciences - STOC 2001
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Approximating extent measures of points
Journal of the ACM (JACM)
Range image segmentation based on randomized Hough transform
Pattern Recognition Letters
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
Analytical description of digital circles
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
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
Hi-index | 0.00 |
An annulus is defined as a set of points contained between two circles. This paper presents a method for fitting an annulus to a given set of points in a 2D images in the presence of noise by maximizing the number of inliers, namely the consensus set, while fixing the thickness. We present a deterministic algorithm that searches the optimal solution(s) within a time complexity of O(N4), N being the number of points.