利用最小二乘法找圆心和半径

 #include <iostream>

#include <vector>

#include <cmath>

#include <Eigen/Dense> // 需安装Eigen库用于矩阵运算

// 定义点结构

struct Point {

    double x, y;

    Point(double x_, double y_) : x(x_), y(y_) {}

};

// 最小二乘法求圆心和半径

bool findCircleByLeastSquares(const std::vector<Point>& points, double& centerX, double& centerY, double& radius) {

    int n = points.size();<