A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
A complete roundness classification procedure
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fitting a set of points by a circle
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Roundness estimation via random sampling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the circle closest to a set of points
Computers and Operations Research - Location analysis
Testing the Quality of Manufactured Balls
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Computer Vision and Image Understanding
Applying particle swarm optimization algorithm to roundness measurement
Expert Systems with Applications: An International Journal
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
Locating Objects in the Plane Using Global Optimization Techniques
Mathematics of Operations Research
Journal of Mathematical Imaging and Vision
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.15 |
The properties and computation of the minimum radial separation (MRS) standard for out-of-roundness are discussed. Another standard out-of-roundness measurement called the minimum area difference (MAD) center is introduced. Although the two centers have different characteristics, the approach to finding both centers shares many commonalities. An O(n log n+k) time algorithm which is used to compute the MRS center is presented. It also computes the MAD center of a simple polygon G, where n is the number of vertices of G, and k is the number of intersection points of the medial axis and the farthest-neighbor Voronoi diagram of G. The relationship between MRS and MAD is discussed.