public class MinEnclosingCircle {
public static void main(String[] args) {
// 示例点集
Point[] points = {
new Point(0, 0),
new Point(4, 0),
new Point(0, 5),
new Point(1, 2),
// 添加更多点...
};
// 假设computeConvexHull是一个外部方法,这里直接用points代替以简化
Point[] hullPoints = points; // 应替换为真实凸包点集
// 寻找最小覆盖圆的圆心和半径
Point center = null;
double radius = 0;
for (int i = 0; i < hullPoints.length; i++) {
for (int j = i + 1; j < hullPoints.length; j++) {
double d = Point.distance(hullPoints[i], hullPoints[j]);
if (d > radius) {
radius = d;
center = Point.midpoint(hullPoints[i], hullPoints[j]);
}
}
}
System.out.println("Center: (" + center.x + ", " + center.y + ")");
System.out.println("Radius: " + radius);
}
}
class Point { double x, y; Point(double x, double y) { this.x = x; this.y = y; } // 计算两点之间的距离 static double distance(Point p1, Point p2) { return Math.sqrt(Math.pow(p1.x - p2.x, 2) + Math.pow(p1.y - p2.y, 2)); } // 计算两点的中点 static Point midpoint(Point p1, Point p2) { return new Point((p1.x + p2.x) / 2, (p1.y + p2.y) / 2); } }