Journal of Algorithms
Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
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 approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Line transversals of balls and smallest enclosing cylinders in three dimensions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Roundness Determination on Convex Polygons
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Testing the Quality of Manufactured Disks and Cylinders
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Efficient Algorithms for the Smallest Enclosing Cylinder Problem
Proceedings of the 8th Canadian Conference on Computational Geometry
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
We consider the problem of testing the roundness of a manufactured ball, using the finger probing model of Cole and Yap [4]. When the center of the object is known, a procedure requiring O(n2) probes and O(n2) computation time is described. (Here n = |1/q|, where q is the quality of the object.) When the center of the object is not known, the procedure requires O(n2) probes and O(n4) computation time. We also give lower bounds that show that the number of probes used by these procedures is optimal.