The authors reproduce, in coordinate-free form, an almost analytic solution for cylindrical regression under a biquadratic error measure.
Algorithms for laying points optimally on a plane and a circle
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On cylindrical regression in three-dimensional Euclidean space
The authors reproduce, in coordinate-free form, an almost analytic solution for cylindrical regression under a biquadratic error measure.