COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND

DOI10.1142/S0218195902000840zbMath1152.68664OpenAlexW2133712135MaRDI QIDQ4818558

Pedro A. Ramos, Olivier Devillers

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195902000840

zbMATH Keywords

linear programminggeometric optimizationroundnesstolerancing metrology

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Culling a Set of Points for Roundness or Cylindricity Evaluations ⋮ Optimizing a constrained convex polygonal annulus ⋮ Certified efficient global roundness evaluation

Cites Work

• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Fitting a set of points by a circle
• Efficient randomized algorithms for some geometric optimization problems
• On geometric optimization with few violated constraints
• A subexponential bound for linear programming
• Approximation by circles

This page was built for publication: COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND