Computational geometry: an introduction
Computational geometry: an introduction
Estimation of a circular arc center and its radius
Computer Vision, Graphics, and Image Processing
On-line construction of the convex hull of a simple polyline
Information Processing Letters
Large sample bias in least squares estimators of a circular arc center and its radius
Computer Vision, Graphics, and Image Processing
A simple approach for the estimation of circular arc center and its radius
Computer Vision, Graphics, and Image Processing
Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital circles with non-lattice point centers
The Visual Computer: International Journal of Computer Graphics
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
Circular arc detection based on Hough transform
Pattern Recognition Letters
An optimal algorithm for roundness determination on convex polygons
Computational Geometry: Theory and Applications
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A Statistical, Nonparametric Methodology for Document Degradation Model Validation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Use of the Hough transformation to detect lines and curves in pictures
Communications of the ACM
On the circle closest to a set of points
Computers and Operations Research - Location analysis
Digitized Circular Arcs: Characterization and Parameter Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Roundness measurements for discontinuous perimeters via machine visions
Computers in Industry
Digital disks and a digital compactness measure
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Comparative Evaluation of Length Estimators of Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Testing the Quality of Manufactured Disks and Balls
Algorithmica
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Robust and Accurate Vectorization of Line Drawings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Circularity of objects in images
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04
Real-time accurate circle fitting with occlusions
Pattern Recognition
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Separating Point Sets by Circles, and the Recognition of Digital Disks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Determining Digital Circularity Using Integer Intervals
Journal of Mathematical Imaging and Vision
Multigrid convergent curvature estimator
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Topological relations between separating circles
Discrete Applied Mathematics
Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph
Journal of Mathematical Imaging and Vision
Hi-index | 0.01 |
This paper focuses on the design of an effective method that computes the measure of circularity of a part of a digital boundary. An existing circularity measure of a set of discrete points, which is used in computational metrology, is extended to the case of parts of digital boundaries. From a single digital boundary, two sets of points are extracted so that the circularity measure computed from these sets is representative of the circularity of the digital boundary. Therefore, the computation consists of two steps. First, the inner and outer sets of points are extracted from the input part of a digital boundary using digital geometry tools. Next, the circularity measure of these sets is computed using classical tools of computational geometry. It is proved that the algorithm is linear in time in the case of convex parts thanks to the specificity of digital data, and is in O(nlogn) otherwise. Experiments done on synthetic and real images illustrate the interest of the properties of the circularity measure.