English

Algorithms for laying points optimally on a plane and a circle

Computational Geometry 2007-05-23 v1 Optimization and Control

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.

Keywords

Cite

@article{arxiv.0705.0350,
  title  = {Algorithms for laying points optimally on a plane and a circle},
  author = {Ruslan Sharipov},
  journal= {arXiv preprint arXiv:0705.0350},
  year   = {2007}
}
R2 v1 2026-06-21T08:24:23.075Z