2019/08/06 by O. V. Ageev, Ageev, O. V., R. A. Sharipov +1
Computer Science · #51N20 #68W25 #Computational Geometry (cs.CG) #FOS: Computer and information sciences #I.3.5 #J.2 #J.6 #acm:51N20 #acm:68W25 #cs.CG #msc:51N20 #msc:68W25
paper · pdf · doi:10.48550/arxiv.1908.02215
AmSTeX, 10 pages, amsppt style
arxiv created 2019/08/06 · arxiv updated 2019/08/07
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.