-
-
Save ddneat/fb883204c5ca268b3c80cf42c8b1ade9 to your computer and use it in GitHub Desktop.
Sutherland–Hodgman algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function isInside(p, [a, b]) { | |
return (b[0] - a[0]) * (p[1] - a[1]) > (b[1] - a[1]) * (p[0] - a[0]); | |
} | |
function getEdges(polygon) { | |
let edges = []; | |
for (let i = 0; i < polygon.length; i++) { | |
let edge = [polygon[(i + polygon.length - 1) % polygon.length], polygon[i]]; | |
edges.push(edge); | |
} | |
return edges; | |
} | |
/** | |
* Calcola il punto di intersezione di due linee | |
* | |
* @see {@link https://en.wikipedia.org/wiki/Line%E2%80%93line_intersection#Given_two_points_on_each_line|Wikipedia} | |
* @param {Array} line0 | |
* @param {Array} line1 | |
* @returns {Array|Boolean} | |
*/ | |
function lineIntersection(line0, line1) { | |
const | |
[x1, y1] = line0[0], | |
[x2, y2] = line0[1], | |
[x3, y3] = line1[0], | |
[x4, y4] = line1[1], | |
denominator = (x1 - x2) * (y3 - y4) - (y1 - y2) * (x3 - x4); | |
if (denominator === 0) { | |
// linee parallele o coincidenti | |
return false; | |
} | |
const | |
numeratorX = (x1 * y2 - y1 * x2) * (x3 - x4) - (x1 - x2) * (x3 * y4 - y3 * x4), | |
numeratorY = (x1 * y2 - y1 * x2) * (y3 - y4) - (y1 - y2) * (x3 * y4 - y3 * x4); | |
let x = numeratorX / denominator, | |
y = numeratorY / denominator; | |
return [x, y]; | |
} | |
/** | |
* | |
* | |
* @see {@link https://en.wikipedia.org/wiki/Sutherland%E2%80%93Hodgman_algorithm|Sutherland–Hodgman algorithm} | |
* @param {any} clipPolygon | |
* @param {any} subjectPolygon | |
* @returns | |
*/ | |
export default function (clipPolygon, subjectPolygon) { | |
let result = subjectPolygon; | |
getEdges(clipPolygon).forEach((clipEdge) => { | |
let pointList = result; | |
result = []; | |
getEdges(pointList).forEach((pointEdge) => { | |
if (isInside(pointEdge[1], clipEdge)) { | |
if (!isInside(pointEdge[0], clipEdge)) { | |
result.push(lineIntersection(pointEdge, clipEdge)); | |
} | |
result.push(pointEdge[1]); | |
} else if (isInside(pointEdge[0], clipEdge)) { | |
result.push(lineIntersection(pointEdge, clipEdge)); | |
} | |
}); | |
}); | |
return result; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment