phaser
Version:
A fast, free and fun HTML5 Game Framework for Desktop and Mobile web browsers from the team at Phaser Studio Inc.
89 lines (74 loc) • 3.02 kB
JavaScript
/**
* @author Florian Vazelle
* @author Geoffrey Glaive
* @copyright 2013-2025 Phaser Studio Inc.
* @license {@link https://opensource.org/licenses/MIT|MIT License}
*/
var Point = require('../point/Point');
var CircleToCircle = require('./CircleToCircle');
/**
* Checks if two Circles intersect and returns the intersection points as a Point object array.
*
* @function Phaser.Geom.Intersects.GetCircleToCircle
* @since 3.0.0
*
* @param {Phaser.Geom.Circle} circleA - The first Circle to check for intersection.
* @param {Phaser.Geom.Circle} circleB - The second Circle to check for intersection.
* @param {array} [out] - An optional array in which to store the points of intersection.
*
* @return {array} An array with the points of intersection if objects intersect, otherwise an empty array.
*/
var GetCircleToCircle = function (circleA, circleB, out)
{
if (out === undefined) { out = []; }
if (CircleToCircle(circleA, circleB))
{
var x0 = circleA.x;
var y0 = circleA.y;
var r0 = circleA.radius;
var x1 = circleB.x;
var y1 = circleB.y;
var r1 = circleB.radius;
var coefficientA, coefficientB, coefficientC, lambda, x;
if (y0 === y1)
{
x = ((r1 * r1) - (r0 * r0) - (x1 * x1) + (x0 * x0)) / (2 * (x0 - x1));
coefficientA = 1;
coefficientB = -2 * y1;
coefficientC = (x1 * x1) + (x * x) - (2 * x1 * x) + (y1 * y1) - (r1 * r1);
lambda = (coefficientB * coefficientB) - (4 * coefficientA * coefficientC);
if (lambda === 0)
{
out.push(new Point(x, (-coefficientB / (2 * coefficientA))));
}
else if (lambda > 0)
{
out.push(new Point(x, (-coefficientB + Math.sqrt(lambda)) / (2 * coefficientA)));
out.push(new Point(x, (-coefficientB - Math.sqrt(lambda)) / (2 * coefficientA)));
}
}
else
{
var v1 = (x0 - x1) / (y0 - y1);
var n = (r1 * r1 - r0 * r0 - x1 * x1 + x0 * x0 - y1 * y1 + y0 * y0) / (2 * (y0 - y1));
coefficientA = (v1 * v1) + 1;
coefficientB = (2 * y0 * v1) - (2 * n * v1) - (2 * x0);
coefficientC = (x0 * x0) + (y0 * y0) + (n * n) - (r0 * r0) - (2 * y0 * n);
lambda = (coefficientB * coefficientB) - (4 * coefficientA * coefficientC);
if (lambda === 0)
{
x = (-coefficientB / (2 * coefficientA));
out.push(new Point(x, (n - (x * v1))));
}
else if (lambda > 0)
{
x = (-coefficientB + Math.sqrt(lambda)) / (2 * coefficientA);
out.push(new Point(x, (n - (x * v1))));
x = (-coefficientB - Math.sqrt(lambda)) / (2 * coefficientA);
out.push(new Point(x, (n - (x * v1))));
}
}
}
return out;
};
module.exports = GetCircleToCircle;