Algorithms for laying points optimally on a plane and a circle
arXiv:0705.0350
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.
AmSTeX, 6 pages, amsppt style