Algorithms for laying points optimally on a plane and a circle

Simple item page
dc.creatorSharipov, Ruslan
dc.date2007-05-02
dc.date.accessioned2026-07-07T07:59:24Z
dc.date.available2026-07-07T07:59:24Z
dc.descriptionTwo 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.
dc.descriptionAmSTeX, 6 pages, amsppt style
dc.identifierhttps://arxiv.org/abs/0705.0350
dc.identifierhttp://arxiv.org/abs/0705.0350
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128355
dc.subjectComputational Geometry
dc.subjectOptimization and Control
dc.subjectF.2.2
dc.titleAlgorithms for laying points optimally on a plane and a circle
dc.typetext

Files

Collections

arXiv