Algorithms for laying points optimally on a plane and a circle

TL;DR

This paper examines two averaging algorithms designed to optimally approximate a set of points in three-dimensional space with either a plane or a circle, aiming to improve geometric fitting methods.

Contribution

The paper introduces and analyzes two averaging algorithms specifically tailored for optimal plane and circle approximation in 3D space, advancing geometric approximation techniques.

Findings

Algorithms effectively approximate point groups with planes and circles.

Improved accuracy over previous geometric fitting methods.

Potential applications in 3D modeling and computer vision.

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.