pax_global_header 0000666 0000000 0000000 00000000064 13060564314 0014514 g ustar 00root root 0000000 0000000 52 comment=1bfcdc8b63578b936c785639fa73cec566713c45
d3-polygon-1.0.3/ 0000775 0000000 0000000 00000000000 13060564314 0013510 5 ustar 00root root 0000000 0000000 d3-polygon-1.0.3/.eslintrc 0000664 0000000 0000000 00000000147 13060564314 0015336 0 ustar 00root root 0000000 0000000 parserOptions:
sourceType: module
extends:
"eslint:recommended"
rules:
no-cond-assign: 0
d3-polygon-1.0.3/.gitignore 0000664 0000000 0000000 00000000100 13060564314 0015467 0 ustar 00root root 0000000 0000000 *.sublime-workspace
.DS_Store
build/
node_modules
npm-debug.log
d3-polygon-1.0.3/.npmignore 0000664 0000000 0000000 00000000036 13060564314 0015506 0 ustar 00root root 0000000 0000000 *.sublime-*
build/*.zip
test/
d3-polygon-1.0.3/LICENSE 0000664 0000000 0000000 00000002703 13060564314 0014517 0 ustar 00root root 0000000 0000000 Copyright 2010-2016 Mike Bostock
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the author nor the names of contributors may be used to
endorse or promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
d3-polygon-1.0.3/README.md 0000664 0000000 0000000 00000006125 13060564314 0014773 0 ustar 00root root 0000000 0000000 # d3-polygon
This module provides a few basic geometric operations for two-dimensional polygons. Each polygon is represented as an array of two-element arrays [[x1, y1], [x2, y2], …], and may either be closed (wherein the first and last point are the same) or open (wherein they are not). Typically polygons are in counterclockwise order, assuming a coordinate system where the origin ⟨0,0⟩ is in the top-left corner.
## Installing
If you use NPM, `npm install d3-polygon`. Otherwise, download the [latest release](https://github.com/d3/d3-polygon/releases/latest). You can also load directly from [d3js.org](https://d3js.org), either as a [standalone library](https://d3js.org/d3-polygon.v1.min.js) or as part of [D3 4.0](https://github.com/d3/d3). AMD, CommonJS, and vanilla environments are supported. In vanilla, a `d3` global is exported:
```html
```
[Try d3-polygon in your browser.](https://tonicdev.com/npm/d3-polygon)
## API Reference
# d3.polygonArea(polygon) [<>](https://github.com/d3/d3-polygon/blob/master/src/area.js#L1 "Source Code")
Returns the signed area of the specified *polygon*. If the vertices of the polygon are in counterclockwise order (assuming a coordinate system where the origin ⟨0,0⟩ is in the top-left corner), the returned area is positive; otherwise it is negative, or zero.
# d3.polygonCentroid(polygon) [<>](https://github.com/d3/d3-polygon/blob/master/src/centroid.js#L1 "Source Code")
Returns the [centroid](https://en.wikipedia.org/wiki/Centroid) of the specified *polygon*.
# d3.polygonHull(points) [<>](https://github.com/d3/d3-polygon/blob/master/src/hull.js#L23 "Source Code")
Returns the [convex hull](https://en.wikipedia.org/wiki/Convex_hull) of the specified *points* using [Andrew’s monotone chain algorithm](http://en.wikibooks.org/wiki/Algorithm_Implementation/Geometry/Convex_hull/Monotone_chain). The returned hull is represented as an array containing a subset of the input *points* arranged in counterclockwise order. Returns null if *points* has fewer than three elements.
# d3.polygonContains(polygon, point) [<>](https://github.com/d3/d3-polygon/blob/master/src/contains.js#L1 "Source Code")
Returns true if and only if the specified *point* is [inside the specified *polygon*](https://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html).
# d3.polygonLength(polygon) [<>](https://github.com/d3/d3-polygon/blob/master/src/length.js#L1 "Source Code")
Returns the length of the perimeter of the specified *polygon*.
d3-polygon-1.0.3/d3-polygon.sublime-project 0000664 0000000 0000000 00000000271 13060564314 0020531 0 ustar 00root root 0000000 0000000 {
"folders": [
{
"path": ".",
"file_exclude_patterns": [
"*.sublime-workspace"
],
"folder_exclude_patterns": [
"build"
]
}
]
}
d3-polygon-1.0.3/img/ 0000775 0000000 0000000 00000000000 13060564314 0014264 5 ustar 00root root 0000000 0000000 d3-polygon-1.0.3/img/hull.png 0000664 0000000 0000000 00000025753 13060564314 0015752 0 ustar 00root root 0000000 0000000 PNG
IHDR /
iCCPICC Profile HPSϽ Bｃ**!JbG\ *"TV",*X#}o{3ߜ||䜙 _f i,A=*:
8 )a2AA w}l_%Nd ! d!|
_ 5VegyAg3- ?ϽssB d
8 ~GlCF#lcsy["Jb"됑g0--} Ou8/drD<-s{p35vo
PG$ ]ٳt?.0=,' } l S])X|[`Az>/u~C b,pNRXgs#.pfJ wQ^ (}cZbo,ZYIa>=Da'xxp|~&?5hToQ>3;Tnr8X'H? VϞ+_#r-I3x,cC wn'}OKb. $Y15 | bN r vpf%df:fi TF X_o+xP$
2B٢QT"Jڀ*@PM.T &jEStG
Rt
AOc(% Da8U|L1ӊ|b4냍&cbw`a!(v p@ Ý>IxU9 sY
s4AE'5]jB:a0M$ adfb xD"H$.iBL!}&KX\K&'P(J %RO@yB$F3c6{#Nw_!#^,~Rk SbDD]IIdd+/pRRRl*TU'U>s/2tWz*KPSRQU
M먇7? jj$jјT \٨@eu@OkJ[G;R{v 9 NN#]nn-=^!A}XJ?ILl`m58d0d13V5"e5ӌsۍߘhĘ13njejZmL,읹9˼bE[KÖVV[zYX m4mlmJlshw} ? R ^,Yzɨ#ӱq؉tiY͙\EÅRU57S7[۔znGǀgg/u/WׄZn eQϘ]G +{/
| % \,,d]H_(5tehC0]auÅ=S EQ&Q룮E+Ds;bp1151<_6k {g˯PXJ̕'0qq
q_*d<#<~:zvac'8&%u}aM_pܫlҮ*>=}YuDuO?(|ׅ7(5jb
8dTLk.l-?|߉'Ni*oAmk&ړڇ;;:};{ Z132gv%;;s.d7yў=/D];pK^.x+Wm_oկmmw
v
-:{ 7/bܺv{;wݍ;|}o d?~QcOT[O F_ױggU0qzk|岗c_!G7t"jb̻ ~34c驂O>~%u}h&mf0
81w P0 Ql s9YP@& r -8k\ la!(3|qO33uM033}hf[5} 3?,l 5 iTXtXML:com.adobe.xmp
500
500
-vp hPLTE
"## ,$!- $ %".#.(8)8$/%/+9+:0C1D 9N 3E 4F 9O #AZ$ʀ+OwK
ê;υ? !/:ywȅ[Lh8 v^a혇+ɐ11 5cgMw:`}"Cl83IhlIԶP&D7 |lԋ{\wE]x!e<g.uSx%5{&VH$2*B(rv M|dC;fn~01bUC?Mn0t[JȷW/#l]nX !'u~Ǚe%<=ʣBt-e`. Щ̅MrT)ݥH̝yЃ\a|>saf>οfAX:ag~iC:BTMMb:cХekE?՞ڄ&
^8H>2t;-/Vu
4MnU+ f
t- ֍/
I }!H1Je\[W=C%?@)UD,@E"ͽ&ve< 'fM̅Ha-%WzH }mbf|s s_^t /`NC s /`K zP-MA/0j~ۘu,j2Ly7GB8dԩaӾO}2&jAB!BijGn;nW4mLwE
(Y晓_02BW5# y\ |\3u)rs /@E~4^TnaHn%.Q>b."Yč /RA!w%ݔ)G̅Ѐ)O̅.s \r5>,0^̃Wx3wUozQx|c) /B?`CagE
/`+ˁ`B:B Bizo%QT3Ճ"Чgs] !HF4ŅOp9Th˸8 IF̚Hu^ bnBTE_.ʕ+{tT
j
P&CoWMHE2#O : :b."Ȗp's8CjgW3=;3 YL*hH {#:[\k
/nC$ZH ! F4XcyMۚ<]QЫ6>7u> 6 ^BYnK}Y<,Vd)_#.Yw zSxq sO .ZSOa5nÁM?z
OR ~jPy ?}'л'!Ɵ?8ř㇗wwyOѦJ|ܷ8DM1|ݣ:Vw&8 ѭL\e]*8/^[H$2ML ?emӻ;g%p@ &fXr$[YJ936[6ĭt9ս ٣{$im`O
/@Tl1/]aFCQi/k^}
wix: b>ꇲMH)
1x;n@RJc0 6W3ZTַ~>ؒӴU|(==!t3h0zfZQv-hsT4x9~:b2o/l81}E8mcWۣ; V G[Pl0{? Jc"ʟ' uW1QѶƵ ̛#v#T|g/Z! ,aTٴq_ԈGFe6=R湇B+(S4n^Pߢҍ>7f~}__ֈ2 y4 l1 O, < xñ!tݳ^5;ַR(+A$#\r{cc rc
uj96婨aU@1lx&}
nmTQ[rl ;/#I8TE5
nH Bey xԿ uiޞ}ڒI9D8Ծ=͛_?/bk? }Y,ٞ ';PldbDma~sf 1Y̍GwIrge݁bKuOUM_bo:L&S }wW>M;Ql1yGjԪ~3Cuu2 q_BiP #C"
-[n'KX
bḅtUUڟ
y 5ܼ*RН bH[\9 |=pk߁~w>tvFg
/A?u _,R[bǻ!t2Q}𣕿y
o
AwrH#Ql4q5.4ig-XVh9p}}q~Rw v+8bJXB ] jD%q/* q_1 Ȭ G}kS A+
k'nw1ތ fE{BKg ckJv>|X]1C&ڇH -*`J} Q49K? VzwҝyB$P I^Z~[dWwvLN G|U*e"1]ahOTDsw4ޔdkvt \{ -ꡁ-SV9!D zG#Zk P >?3Н,Xl _K ],э鎴&r^9'rC.ӧz @ h^daf"qsGwηZtw1uciw3W!D~
w3QOETSs6y zU^ܭj`hDC%{?W^͝J ~䁤X䊍 iԈ^ ~"5X|eikv^ ? hW[os3ws1yT_vKs_І+y̲#^="CXk5As?MmCP'{ /Ά:Y4Um-!Ǡ*-;NuF) /K IN>}[|ʣ\$~ꅼO;O,%oQZ sXk֞f(8~Ayx{
dewHT84۔s
i lgSWd; Db(ð*Q{6:9Tr/.|Siϐ簹`U6=e#yJp/>C 2i jD;-MrK.b}y'i_$fXp;;M+1#o@Y)&S$nA?O( >vy(0^1i 7t v^\~vt{NZH|
|6?-m6Z%
Mi%ݎ c
zJA] zɖ=zFɍnq)F
Dt쪦g֮&3I콗zS!.1U ֭U͞f|LK{лGL=:OP+Z*fg:ٶeD7w\J +q ==ؼ&yiwt*&W
Y(
ݵ)q
/Bw-G UIB>o[ ysKOkOB<ԏ0=-.uסOs"Hp}|*/amZ4: jDeGGMe6c݇~9?D&9a `e'gwpģ?ߥP`ϣBT s=c +LHI2Q9W`Q': s| ^fkBX){} q@yKCƣ HBJrCoп]f߯y9 %>s.Pe@V.|) ; $.º_$ޢaM%>.%w)~'*I U7B($83H<>$jD;"/@ t| f_'Q(-Z^/JNB\4*Y Ч Oӟmѐ)o'#|NB| E
ڝuI } opNZ @hӹt
0nױfRuN^ bw q{_͉R8)s zU*/+x!G=Qvm]6prCflՐpr
ЩiϭyTjrodN_m~,#t/ ЩҎg;].8Es]GNSP#evߦ @?Ox.HJݦԍ
RmJ)ݞԍ
b=5_ Rg&^_ tRX*$S :5=2(f=QCW(u/5S:u<1q $M8{1ۼO իHfa &tn8E{
]1tS7_8u+Puv+u)
]Mf6tyS bJ$7pC2uv+u]M2n/;Ѓ)b]ԭ! M 螧n*8@8u{! M1'螥n1`n8A uS 1`n8Aw3uv+uS+ΗlMqSt+Aw0ug;Nx?8 CNSbJ~Kvno;Ѓ } ߡە - \ Ϟ \ ϒ/
\@OT_
\`[OkZg$VR7_@A8u S7A LF
\Рng7uKR K3.?nwD4b"udy,3p~i|.x./R7#.SBﭿ:"uS"b,b,b,b,b,b,b,b,Y Y Y Y Y Y Y Y :::::::/V:$ IENDB` d3-polygon-1.0.3/index.js 0000664 0000000 0000000 00000000423 13060564314 0015154 0 ustar 00root root 0000000 0000000 export {default as polygonArea} from "./src/area";
export {default as polygonCentroid} from "./src/centroid";
export {default as polygonHull} from "./src/hull";
export {default as polygonContains} from "./src/contains";
export {default as polygonLength} from "./src/length";
d3-polygon-1.0.3/package.json 0000664 0000000 0000000 00000002661 13060564314 0016003 0 ustar 00root root 0000000 0000000 {
"name": "d3-polygon",
"version": "1.0.3",
"description": "Operations for two-dimensional polygons.",
"keywords": [
"d3",
"d3-module",
"polygon",
"hull",
"geometry",
"graphics"
],
"homepage": "https://d3js.org/d3-polygon/",
"license": "BSD-3-Clause",
"author": {
"name": "Mike Bostock",
"url": "http://bost.ocks.org/mike"
},
"main": "build/d3-polygon.js",
"module": "index",
"jsnext:main": "index",
"repository": {
"type": "git",
"url": "https://github.com/d3/d3-polygon.git"
},
"scripts": {
"pretest": "rm -rf build && mkdir build && rollup --banner \"$(preamble)\" -f umd -n d3 -o build/d3-polygon.js -- index.js",
"test": "tape 'test/**/*-test.js' && eslint index.js src",
"prepublish": "npm run test && uglifyjs --preamble \"$(preamble)\" build/d3-polygon.js -c -m -o build/d3-polygon.min.js",
"postpublish": "git push && git push --tags && cd ../d3.github.com && git pull && cp ../d3-polygon/build/d3-polygon.js d3-polygon.v1.js && cp ../d3-polygon/build/d3-polygon.min.js d3-polygon.v1.min.js && git add d3-polygon.v1.js d3-polygon.v1.min.js && git commit -m \"d3-polygon ${npm_package_version}\" && git push && cd - && zip -j build/d3-polygon.zip -- LICENSE README.md build/d3-polygon.js build/d3-polygon.min.js"
},
"devDependencies": {
"eslint": "3",
"package-preamble": "0.0",
"rollup": "0.41",
"tape": "4",
"uglify-js": "^2.8.11"
}
}
d3-polygon-1.0.3/src/ 0000775 0000000 0000000 00000000000 13060564314 0014277 5 ustar 00root root 0000000 0000000 d3-polygon-1.0.3/src/area.js 0000664 0000000 0000000 00000000363 13060564314 0015547 0 ustar 00root root 0000000 0000000 export default function(polygon) {
var i = -1,
n = polygon.length,
a,
b = polygon[n - 1],
area = 0;
while (++i < n) {
a = b;
b = polygon[i];
area += a[1] * b[0] - a[0] * b[1];
}
return area / 2;
}
d3-polygon-1.0.3/src/centroid.js 0000664 0000000 0000000 00000000532 13060564314 0016444 0 ustar 00root root 0000000 0000000 export default function(polygon) {
var i = -1,
n = polygon.length,
x = 0,
y = 0,
a,
b = polygon[n - 1],
c,
k = 0;
while (++i < n) {
a = b;
b = polygon[i];
k += c = a[0] * b[1] - b[0] * a[1];
x += (a[0] + b[0]) * c;
y += (a[1] + b[1]) * c;
}
return k *= 3, [x / k, y / k];
}
d3-polygon-1.0.3/src/contains.js 0000664 0000000 0000000 00000000633 13060564314 0016455 0 ustar 00root root 0000000 0000000 export default function(polygon, point) {
var n = polygon.length,
p = polygon[n - 1],
x = point[0], y = point[1],
x0 = p[0], y0 = p[1],
x1, y1,
inside = false;
for (var i = 0; i < n; ++i) {
p = polygon[i], x1 = p[0], y1 = p[1];
if (((y1 > y) !== (y0 > y)) && (x < (x0 - x1) * (y - y1) / (y0 - y1) + x1)) inside = !inside;
x0 = x1, y0 = y1;
}
return inside;
}
d3-polygon-1.0.3/src/cross.js 0000664 0000000 0000000 00000000622 13060564314 0015766 0 ustar 00root root 0000000 0000000 // Returns the 2D cross product of AB and AC vectors, i.e., the z-component of
// the 3D cross product in a quadrant I Cartesian coordinate system (+x is
// right, +y is up). Returns a positive value if ABC is counter-clockwise,
// negative if clockwise, and zero if the points are collinear.
export default function(a, b, c) {
return (b[0] - a[0]) * (c[1] - a[1]) - (b[1] - a[1]) * (c[0] - a[0]);
}
d3-polygon-1.0.3/src/hull.js 0000664 0000000 0000000 00000003256 13060564314 0015607 0 ustar 00root root 0000000 0000000 import cross from "./cross";
function lexicographicOrder(a, b) {
return a[0] - b[0] || a[1] - b[1];
}
// Computes the upper convex hull per the monotone chain algorithm.
// Assumes points.length >= 3, is sorted by x, unique in y.
// Returns an array of indices into points in left-to-right order.
function computeUpperHullIndexes(points) {
var n = points.length,
indexes = [0, 1],
size = 2;
for (var i = 2; i < n; ++i) {
while (size > 1 && cross(points[indexes[size - 2]], points[indexes[size - 1]], points[i]) <= 0) --size;
indexes[size++] = i;
}
return indexes.slice(0, size); // remove popped points
}
export default function(points) {
if ((n = points.length) < 3) return null;
var i,
n,
sortedPoints = new Array(n),
flippedPoints = new Array(n);
for (i = 0; i < n; ++i) sortedPoints[i] = [+points[i][0], +points[i][1], i];
sortedPoints.sort(lexicographicOrder);
for (i = 0; i < n; ++i) flippedPoints[i] = [sortedPoints[i][0], -sortedPoints[i][1]];
var upperIndexes = computeUpperHullIndexes(sortedPoints),
lowerIndexes = computeUpperHullIndexes(flippedPoints);
// Construct the hull polygon, removing possible duplicate endpoints.
var skipLeft = lowerIndexes[0] === upperIndexes[0],
skipRight = lowerIndexes[lowerIndexes.length - 1] === upperIndexes[upperIndexes.length - 1],
hull = [];
// Add upper hull in right-to-l order.
// Then add lower hull in left-to-right order.
for (i = upperIndexes.length - 1; i >= 0; --i) hull.push(points[sortedPoints[upperIndexes[i]][2]]);
for (i = +skipLeft; i < lowerIndexes.length - skipRight; ++i) hull.push(points[sortedPoints[lowerIndexes[i]][2]]);
return hull;
}
d3-polygon-1.0.3/src/length.js 0000664 0000000 0000000 00000000567 13060564314 0016126 0 ustar 00root root 0000000 0000000 export default function(polygon) {
var i = -1,
n = polygon.length,
b = polygon[n - 1],
xa,
ya,
xb = b[0],
yb = b[1],
perimeter = 0;
while (++i < n) {
xa = xb;
ya = yb;
b = polygon[i];
xb = b[0];
yb = b[1];
xa -= xb;
ya -= yb;
perimeter += Math.sqrt(xa * xa + ya * ya);
}
return perimeter;
}
d3-polygon-1.0.3/test/ 0000775 0000000 0000000 00000000000 13060564314 0014467 5 ustar 00root root 0000000 0000000 d3-polygon-1.0.3/test/area-test.js 0000664 0000000 0000000 00000003046 13060564314 0016715 0 ustar 00root root 0000000 0000000 var tape = require("tape"),
polygon = require("../");
tape("polygonArea(polygon) returns the expected value for closed counterclockwise polygons", function(test) {
test.equal(polygon.polygonArea([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), 1);
test.end();
});
tape("polygonArea(polygon) returns the expected value for closed clockwise polygons", function(test) {
test.equal(polygon.polygonArea([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), -1);
test.equal(polygon.polygonArea([[1, 1], [3, 2], [2, 3], [1, 1]]), -1.5);
test.end();
});
tape("polygonArea(polygon) returns the expected value for open counterclockwise polygons", function(test) {
test.equal(polygon.polygonArea([[0, 0], [0, 1], [1, 1], [1, 0]]), 1);
test.end();
});
tape("polygonArea(polygon) returns the expected value for open clockwise polygons", function(test) {
test.equal(polygon.polygonArea([[0, 0], [1, 0], [1, 1], [0, 1]]), -1);
test.equal(polygon.polygonArea([[1, 1], [3, 2], [2, 3]]), -1.5);
test.end();
});
tape("polygonArea(polygon) returns the expected value for a very large polygon", function(test) {
var start = 0,
stop = 1e8,
step = 1e4,
points = [];
for (var value = 0; value < stop; value += step) points.push([0, value]);
for (var value = 0; value < stop; value += step) points.push([value, stop]);
for (var value = stop - step; value >= 0; value -= step) points.push([stop, value]);
for (var value = stop - step; value >= 0; value -= step) points.push([value, 0]);
test.equal(polygon.polygonArea(points), 1e16 - 5e7);
test.end();
});
d3-polygon-1.0.3/test/centroid-test.js 0000664 0000000 0000000 00000003261 13060564314 0017613 0 ustar 00root root 0000000 0000000 var tape = require("tape"),
polygon = require("../");
tape("polygonCentroid(points) returns the expected value for closed counterclockwise polygons", function(test) {
test.deepEqual(polygon.polygonCentroid([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), [.5, .5]);
test.end();
});
tape("polygonCentroid(points) returns the expected value for closed clockwise polygons", function(test) {
test.deepEqual(polygon.polygonCentroid([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), [.5, .5]);
test.deepEqual(polygon.polygonCentroid([[1, 1], [3, 2], [2, 3], [1, 1]]), [2, 2]);
test.end();
});
tape("polygonCentroid(points) returns the expected value for open counterclockwise polygons", function(test) {
test.deepEqual(polygon.polygonCentroid([[0, 0], [0, 1], [1, 1], [1, 0]]), [.5, .5]);
test.end();
});
tape("polygonCentroid(points) returns the expected value for closed counterclockwise polygons", function(test) {
test.deepEqual(polygon.polygonCentroid([[0, 0], [1, 0], [1, 1], [0, 1]]), [.5, .5]);
test.deepEqual(polygon.polygonCentroid([[1, 1], [3, 2], [2, 3]]), [2, 2]);
test.end();
});
tape("polygonCentroid(polygon) returns the expected value for a very large polygon", function(test) {
var start = 0,
stop = 1e8,
step = 1e4,
points = [];
for (var value = 0; value < stop; value += step) points.push([0, value]);
for (var value = 0; value < stop; value += step) points.push([value, stop]);
for (var value = stop - step; value >= 0; value -= step) points.push([stop, value]);
for (var value = stop - step; value >= 0; value -= step) points.push([value, 0]);
test.deepEqual(polygon.polygonCentroid(points), [49999999.75000187, 49999999.75001216]);
test.end();
});
d3-polygon-1.0.3/test/contains-test.js 0000664 0000000 0000000 00000003024 13060564314 0017617 0 ustar 00root root 0000000 0000000 var tape = require("tape"),
polygon = require("../");
tape("polygonContains(polygon, point) returns the expected value for closed counterclockwise polygons", function(test) {
test.equal(polygon.polygonContains([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]], [0.5, 0.5]), true);
test.equal(polygon.polygonContains([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]], [1.5, 0.5]), false);
test.equal(polygon.polygonContains([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]], [-0.5, 0.5]), false);
test.equal(polygon.polygonContains([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]], [0.5, 1.5]), false);
test.equal(polygon.polygonContains([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]], [0.5, -0.5]), false);
test.end();
});
tape("polygonContains(polygon, point) returns the expected value for closed clockwise polygons", function(test) {
test.equal(polygon.polygonContains([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]], [0.5, 0.5]), true);
test.equal(polygon.polygonContains([[1, 1], [3, 2], [2, 3], [1, 1]], [1.5, 1.5]), true);
test.end();
});
tape("polygonContains(polygon, point) returns the expected value for open counterclockwise polygons", function(test) {
test.equal(polygon.polygonContains([[0, 0], [0, 1], [1, 1], [1, 0]], [0.5, 0.5]), true);
test.end();
});
tape("polygonContains(polygon, point) returns the expected value for open clockwise polygons", function(test) {
test.equal(polygon.polygonContains([[0, 0], [1, 0], [1, 1], [0, 1]], [0.5, 0.5]), true);
test.equal(polygon.polygonContains([[1, 1], [3, 2], [2, 3]], [1.5, 1.5]), true);
test.end();
});
d3-polygon-1.0.3/test/hull-test.js 0000664 0000000 0000000 00000003711 13060564314 0016750 0 ustar 00root root 0000000 0000000 var tape = require("tape"),
polygon = require("../");
tape("polygonHull(points) returns null if points has fewer than three elements", function(test) {
test.equal(polygon.polygonHull([]), null);
test.equal(polygon.polygonHull([[0, 1]]), null);
test.equal(polygon.polygonHull([[0, 1], [1, 0]]), null);
test.end();
});
tape("polygonHull(points) returns the convex hull of the specified points", function(test) {
test.deepEqual(polygon.polygonHull([[200, 200], [760, 300], [500, 500]]), [[760, 300], [200, 200], [500, 500]]);
test.deepEqual(polygon.polygonHull([[200, 200], [760, 300], [500, 500], [400, 400]]), [[760, 300], [200, 200], [500, 500]]);
test.end();
});
tape("polygonHull(points) handles points with duplicate ordinates", function(test) {
test.deepEqual(polygon.polygonHull([[-10, -10], [10, 10], [10, -10], [-10, 10]]), [[10, 10], [10, -10], [-10, -10], [-10, 10]]);
test.end();
});
tape("polygonHull(points) handles overlapping upper and lower hulls", function(test) {
test.deepEqual(polygon.polygonHull([[0, -10], [0, 10], [0, 0], [10, 0], [-10, 0]]), [[10, 0], [0, -10], [-10, 0], [0, 10]]);
test.end();
});
// Cases below taken from http://uva.onlinejudge.org/external/6/681.html
tape("polygonHull(points) handles various non-trivial hulls", function(test) {
test.deepEqual(polygon.polygonHull([[60, 20], [250, 140], [180, 170], [79, 140], [50, 60], [60, 20]]), [[250, 140], [60, 20], [50, 60], [79, 140], [180, 170]]);
test.deepEqual(polygon.polygonHull([[50, 60], [60, 20], [70, 45], [100, 70], [125, 90], [200, 113], [250, 140], [180, 170], [105, 140], [79, 140], [60, 85], [50, 60]]), [[250, 140], [60, 20], [50, 60], [79, 140], [180, 170]]);
test.deepEqual(polygon.polygonHull([[30, 30], [50, 60], [60, 20], [70, 45], [86, 39], [112, 60], [200, 113], [250, 50], [300, 200], [130, 240], [76, 150], [47, 76], [36, 40], [33, 35], [30, 30]]), [[300, 200], [250, 50], [60, 20], [30, 30], [47, 76], [76, 150], [130, 240]]);
test.end();
});
d3-polygon-1.0.3/test/length-test.js 0000664 0000000 0000000 00000002056 13060564314 0017266 0 ustar 00root root 0000000 0000000 var tape = require("tape"),
polygon = require("../");
tape("polygonLength(polygon) returns the expected value for closed counterclockwise polygons", function(test) {
test.equal(polygon.polygonLength([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), 4);
test.end();
});
tape("polygonLength(polygon) returns the expected value for closed clockwise polygons", function(test) {
test.equal(polygon.polygonLength([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), 4);
test.equal(polygon.polygonLength([[1, 1], [3, 2], [2, 3], [1, 1]]), Math.sqrt(20) + Math.sqrt(2));
test.end();
});
tape("polygonLength(polygon) returns the expected value for open counterclockwise polygons", function(test) {
test.equal(polygon.polygonLength([[0, 0], [0, 1], [1, 1], [1, 0]]), 4);
test.end();
});
tape("polygonLength(polygon) returns the expected value for open clockwise polygons", function(test) {
test.equal(polygon.polygonLength([[0, 0], [1, 0], [1, 1], [0, 1]]), 4);
test.equal(polygon.polygonLength([[1, 1], [3, 2], [2, 3]]), Math.sqrt(20) + Math.sqrt(2));
test.end();
});