在笛卡尔平面上找到最近的点？

import math

def distance(point1, point2):
    return math.sqrt((point1[0] - point2[0]) ** 2 + (point1[1] - point2[1]) ** 2)

def find_nearest_point(reference_point, points):
    nearest_point = None
    min_distance = float('inf')
    for point in points:
        dist = distance(reference_point, point)
        if dist < min_distance:
            min_distance = dist
            nearest_point = point
    return nearest_point

# 示例
reference_point = (0, 0)
points = [(1, 2), (3, 4), (-1, -2), (5, 6)]
nearest = find_nearest_point(reference_point, points)
print("最近的点是:", nearest)

from scipy.spatial import KDTree

def find_nearest_point_kd(reference_point, points):
    tree = KDTree(points)
    dist, idx = tree.query(reference_point)
    return points[idx]

# 示例
reference_point = (0, 0)
points = [(1, 2), (3, 4), (-1, -2), (5, 6)]
nearest = find_nearest_point_kd(reference_point, points)
print("最近的点是:", nearest)