Algorithms for laying points optimally on a plane and a circle - Computer Science > Computational GeometryReport as inadecuate




Algorithms for laying points optimally on a plane and a circle - Computer Science > Computational Geometry - Download this document for free, or read online. Document in PDF available to download.

Abstract: Two averaging algorithms are considered which are intended for choosing anoptimal plane and an optimal circle approximating a group of points inthree-dimensional Euclidean space.



Author: Ruslan Sharipov

Source: https://arxiv.org/







Related documents