README

angular sweep 算法的 PHP 实现

解决在给定半径的圆内找到最大封闭点的中心点的问题。

https://en.wikipedia.org/wiki/Visibility_polygon#Angular_sweep

https://www.geeksforgeeks.org/angular-sweep-maximum-points-can-enclosed-circle-given-radius/

https://github.com/pear/Math_Complex/blob/master/Math/Complex.php

安装

composer require hotrush/angular-sweep

用法

use Hotrush\AngularSweep\NumbersCollection;
use Hotrush\AngularSweep\ComplexNumber;
use Hotrush\AngularSweep\AngularSweep;

$coordinates = [
    [6.47634, 7.69628],
    [5.16828, 4.79915],
    [6.69533, 6.20378],
];

$collection = new NumbersCollection();

foreach ($coordinates as $coordinate) {
    $collection->add(new ComplexNumber($coordinate[0], $coordinate[1]));
}

$radius = 1;

$sweep = new AngularSweep($collection, $radius);

echo $sweep->getMax();
// 2

$center = $sweep->getMaxCenter();
echo $center->getReal() . '-' . $center->getIm();
// '6.47634-7.69628'

测试

phpunit

注意事项

https://www.geeksforgeeks.org/find-minimum-radius-atleast-k-point-lie-inside-circle/

hotrush / angular-sweep

维护者

详细信息

README

angular sweep 算法的 PHP 实现

安装

用法

测试

注意事项