The minimum zone cylinder of a set of points in three dimensions is the cylindric crown defined by a pair of coaxial cylinders with minimal radial separation (width). In the context of tolerancing metrology, the set of points is nominally cylindrical, i.e., the points are known to lie in close proximity of a known reference cylinder. Using approximations which are valid only in the neighborhood of the reference cylinder, we can get a very good approximation of the minimum zone cylinder. The process provides successive approximations, and each iteration involves the solution of a linear programming problem in six dimensions. The error between the approximation and the optimal solution converges very rapidly (typically in three iterations in practice) down to a limit error of (8 omega^2)/R ( where omega is the width and R is the external radius of the zone cylinder).
[1]
Jack Snoeyink,et al.
Fitting a Set of Points by a Circle
,
1998,
Discret. Comput. Geom..
[2]
Micha Sharir,et al.
Efficient randomized algorithms for some geometric optimization problems
,
1996,
Discret. Comput. Geom..
[3]
Micha Sharir,et al.
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions
,
1997,
SODA '97.
[4]
Micha Sharir,et al.
Approximation and exact algorithms for minimum-width annuli and shells
,
1999,
SCG '99.
[5]
Micha Sharir,et al.
A Combinatorial Bound for Linear Programming and Related Problems
,
1992,
STACS.
[6]
Olivier Devillers,et al.
Computing Roundness is Easy if the Set is Almost Round
,
2002,
Int. J. Comput. Geom. Appl..