Algorithms for laying points optimally on a plane and a circle

2007/05/02 by Руслан Шарипов, Sharipov, Ruslan
Engineering · Mathematics · #Advanced Theoretical and Applied Studies in Material Sciences and Geometry #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Geodetic Measurements and Engineering Structures #Optimization and Control (math.OC) #Statistical and numerical algorithms

paper · pdf · doi:10.48550/arxiv.0705.0350

openalex publication_date 2007/05/02 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Related

• Subdivision of point-normal pairs with application to smoothing feasible\n robot path
• How To Place a Point to Maximize Angles
• A gradient descent algorithm for computing circle patterns
• Connecting a Set of Circles with Minimum Sum of Radii
• On the Distribution of Minima in Intrinsic-Metric Rotation Averaging