当前位置：首页 > PHP

php实现距离排序

2026-02-15 22:23:07PHP

实现距离排序的方法

在PHP中实现距离排序通常涉及计算两点之间的距离（如经纬度坐标），并根据结果对数据进行排序。以下是几种常见方法：

使用Haversine公式计算经纬度距离

对于地理坐标排序，Haversine公式能计算球面两点间距离。以下示例假设有包含经纬度的数组：

function haversineDistance($lat1, $lon1, $lat2, $lon2) {
    $earthRadius = 6371; // 地球半径（公里）
    $dLat = deg2rad($lat2 - $lat1);
    $dLon = deg2rad($lon2 - $lon1);
    $a = sin($dLat/2) * sin($dLat/2) + cos(deg2rad($lat1)) * cos(deg2rad($lat2)) * sin($dLon/2) * sin($dLon/2);
    $c = 2 * atan2(sqrt($a), sqrt(1-$a));
    return $earthRadius * $c;
}

$referencePoint = ['lat' => 40.7128, 'lon' => -74.0060]; // 纽约坐标
$locations = [
    ['name' => '地点A', 'lat' => 34.0522, 'lon' => -118.2437],
    ['name' => '地点B', 'lat' => 41.8781, 'lon' => -87.6298]
];

foreach ($locations as &$loc) {
    $loc['distance'] = haversineDistance(
        $referencePoint['lat'], $referencePoint['lon'],
        $loc['lat'], $loc['lon']
    );
}
unset($loc);

usort($locations, function($a, $b) {
    return $a['distance'] <=> $b['distance'];
});

二维平面坐标排序

对于平面直角坐标系中的点，使用欧几里得距离公式：

function euclideanDistance($x1, $y1, $x2, $y2) {
    return sqrt(pow($x2 - $x1, 2) + pow($y2 - $y1, 2));
}

$reference = ['x' => 0, 'y' => 0];
$points = [
    ['x' => 3, 'y' => 4],
    ['x' => 1, 'y' => 1]
];

array_walk($points, function(&$point) use ($reference) {
    $point['distance'] = euclideanDistance(
        $reference['x'], $reference['y'],
        $point['x'], $point['y']
    );
});

usort($points, function($a, $b) {
    return $a['distance'] <=> $b['distance'];
});

数据库查询时排序（MySQL示例）

如果数据存储在MySQL中，可直接在SQL中计算距离：

SELECT 
    id, 
    name, 
    (6371 * acos(cos(radians(?)) * cos(radians(lat)) * cos(radians(lng) - radians(?)) + sin(radians(?)) * sin(radians(lat)))) AS distance
FROM locations
ORDER BY distance ASC

绑定参数为参考点的纬度和经度。