Algorithms for laying points optimally on a plane and a circle

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/128355Two 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 styleComputational GeometryOptimization and ControlF.2.2Algorithms for laying points optimally on a plane and a circletext