CGAL point cloud minimum enclosing circle (2D)

1. Introduction

In CGAL, a farthest first heuristic algorithm ( Farthest_first_heuristic) is used to realize the calculation of the smallest enclosing circle of the point cloud. This process is somewhat similar to FPS (farthest point sampling process). The algorithm starts from an arbitrary point s1. Choose a point s2 that is as far away from s1 as possible. By selecting the farthest point si in this way, the distance to the nearest center is maximized, so as to obtain the center and maximum radius of the point set.

Two, implement the code

#include <iostream>
#include <vector>

//内核