Journal of Algorithms
Out-of-Roundness Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
An Optimal Algorithm for Roundness Determination on Convex Polygons
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Computing roundness is easy if the set is almost round
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Roundness estimation via random sampling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Testing the Quality of Manufactured Balls
WADS '99 Proceedings of the 6th International 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
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.03 |