Algorithms for laying points optimally on a plane and a circle
R. Sharipov. (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
%0 Generic
%1 sharipov2007algorithms
%A Sharipov, Ruslan
%D 2007
%K algebra arxiv geometry registration russia
%T Algorithms for laying points optimally on a plane and a circle
%U http://arxiv.org/abs/0705.0350
%X 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.
@misc{sharipov2007algorithms,
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.},
added-at = {2019-01-29T12:39:02.000+0100},
author = {Sharipov, Ruslan},
biburl = {https://www.bibsonomy.org/bibtex/2f29c0c91b35a05ada5a3a59ea5f784c1/analyst},
description = {[0705.0350] Algorithms for laying points optimally on a plane and a circle},
interhash = {709a60768741b02e9ebeb759a6fade78},
intrahash = {f29c0c91b35a05ada5a3a59ea5f784c1},
keywords = {algebra arxiv geometry registration russia},
note = {cite arxiv:0705.0350Comment: AmSTeX, 6 pages, amsppt style},
timestamp = {2019-01-29T12:39:02.000+0100},
title = {Algorithms for laying points optimally on a plane and a circle},
url = {http://arxiv.org/abs/0705.0350},
year = 2007
}