Certified efficient global roundness evaluation
From MaRDI portal
Publication:779864
DOI10.1007/s10957-020-01689-8zbMath1447.90044OpenAlexW3034903784MaRDI QIDQ779864
Publication date: 14 July 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01689-8
global optimizationsphericity errorcircularity errorminimum width annulusminimum zoneroundness evaluation
Cites Work
- Unnamed Item
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Fitting a set of points by a circle
- Circle fitting by linear and nonlinear least squares
- An exact minimum zone solution for sphericity evaluation.
- Approximation algorithms for minimum-width annuli and shells
- Efficient randomized algorithms for some geometric optimization problems
- An optimal algorithm for roundness determination on convex polygons
- ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
- Approximation by circles
This page was built for publication: Certified efficient global roundness evaluation
