<?php
$points = [
[0, -1],
[-2, 3],
[4, 0],
[3, 1],
[5, 2],
[0, 1],
];
$max_closest = [];
foreach ($points as $i => list($ax, $ay)) {
$min_dist = INF;
$dists = [];
foreach ($points as $j => list($bx, $by)) {
if ($i == $j) {
continue;
}
$dists[$j] = $sq_dist = ($bx - $ax) * ($bx - $ax) + ($by - $ay) * ($by - $ay);
if ($sq_dist < $min_dist) {
$min_dist = $sq_dist;
}
}
// select closest points
foreach (array_keys($dists, $min_dist, true) as $key) {
print_r($points[$key]); // print point
// keep track of points that were closest
if (isset($max_closest[$key])) {
++$max_closest[$key];
} else {
$max_closest[$key] = 1;
}
}
}
rsort($max_closest);
foreach (array_keys($max_closest, $max_closest[0], true) as $key) {
print_r($points[$key]); // print point
}
preferences:
40.83 ms | 402 KiB | 5 Q