On cylindrical regression in three-dimensional Euclidean space

Abstract

The three-dimensional cylindrical regression problem is a problem of finding a cylinder best fitting a group of points in three-dimensional Euclidean space. The words best fitting are usually understood in the sense of the minimum root mean square deflection of the given points from a cylinder to be found. In this form the problem has no analytic solution. If one replaces the root mean square averaging by a certain biquadratic averaging, the resulting problem has an almost analytic solution. This solution is reproduced in the present paper in a coordinate-free form.

AmSTeX, 10 pages, amsppt style

References in corpus (5)

• Least square ellipsoid fitting using iterative orthogonal transformations
• Course of linear algebra and multidimensional geometry
• Algorithms for laying points optimally on a plane and a circle
• Direct ellipsoidal fitting of discrete multi-dimensional data
• On linear regression in three-dimensional Euclidean space