Algorithms for laying points optimally on a plane and a circle

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Computational Geometry, Optimization and Control, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/128355

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0705.0350
 http://arxiv.org/abs/0705.0350

Collections

arXiv