@analyst

Algorithms for laying points optimally on a plane and a circle

. (2007)cite arxiv:0705.0350Comment: AmSTeX, 6 pages, amsppt style.

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.

Description

[0705.0350] Algorithms for laying points optimally on a plane and a circle

Links and resources

Tags

community

  • @analyst
  • @dblp
@analyst's tags highlighted