Algorithms for laying points optimally on a plane and a circle
classification
💻 cs.CG
math.OC
keywords
algorithmscircleoptimalplanepointsapproximatingaveragingchoosing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.