-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
7 changed files
with
214 additions
and
54 deletions.
There are no files selected for viewing
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
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
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
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,68 @@ | ||
// Version 0.0.0. Copyright 2017 Mike Bostock. | ||
(function (global, factory) { | ||
typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : | ||
typeof define === 'function' && define.amd ? define(['exports'], factory) : | ||
(factory((global.d3 = global.d3 || {}))); | ||
}(this, function (exports) { 'use strict'; | ||
|
||
// Clips the specified subject polygon to the specified clip polygon; | ||
// requires the clip polygon to be counterclockwise and convex. | ||
// https://en.wikipedia.org/wiki/Sutherland–Hodgman_algorithm | ||
exports.polygonClip = function(clip, subject) { | ||
var input, | ||
closed = polygonClosed(subject), | ||
i = -1, | ||
n = clip.length - polygonClosed(clip), | ||
j, | ||
m, | ||
a = clip[n - 1], | ||
b, | ||
c, | ||
d; | ||
|
||
while (++i < n) { | ||
input = subject.slice(); | ||
subject.length = 0; | ||
b = clip[i]; | ||
c = input[(m = input.length - closed) - 1]; | ||
j = -1; | ||
while (++j < m) { | ||
d = input[j]; | ||
if (polygonInside(d, a, b)) { | ||
if (!polygonInside(c, a, b)) { | ||
subject.push(polygonIntersect(c, d, a, b)); | ||
} | ||
subject.push(d); | ||
} else if (polygonInside(c, a, b)) { | ||
subject.push(polygonIntersect(c, d, a, b)); | ||
} | ||
c = d; | ||
} | ||
if (closed) subject.push(subject[0]); | ||
a = b; | ||
} | ||
|
||
return subject; | ||
}; | ||
|
||
function polygonInside(p, a, b) { | ||
return (b[0] - a[0]) * (p[1] - a[1]) < (b[1] - a[1]) * (p[0] - a[0]); | ||
} | ||
|
||
// Intersect two infinite lines cd and ab. | ||
function polygonIntersect(c, d, a, b) { | ||
var x1 = c[0], x3 = a[0], x21 = d[0] - x1, x43 = b[0] - x3, | ||
y1 = c[1], y3 = a[1], y21 = d[1] - y1, y43 = b[1] - y3, | ||
ua = (x43 * (y1 - y3) - y43 * (x1 - x3)) / (y43 * x21 - x43 * y21); | ||
return [x1 + ua * x21, y1 + ua * y21]; | ||
} | ||
|
||
// Returns true if the polygon is closed. | ||
function polygonClosed(coordinates) { | ||
var a = coordinates[0], | ||
b = coordinates[coordinates.length - 1]; | ||
return !(a[0] - b[0] || a[1] - b[1]); | ||
} | ||
|
||
Object.defineProperty(exports, '__esModule', {value: true}); | ||
})); |
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
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
Oops, something went wrong.