StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics
https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
196 lines
5.4 KiB
196 lines
5.4 KiB
(function (global, factory) {
|
|
typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
|
|
typeof define === 'function' && define.amd ? define(factory) :
|
|
(global.KDBush = factory());
|
|
}(this, (function () { 'use strict';
|
|
|
|
function sortKD(ids, coords, nodeSize, left, right, depth) {
|
|
if (right - left <= nodeSize) { return; }
|
|
|
|
var m = (left + right) >> 1;
|
|
|
|
select(ids, coords, m, left, right, depth % 2);
|
|
|
|
sortKD(ids, coords, nodeSize, left, m - 1, depth + 1);
|
|
sortKD(ids, coords, nodeSize, m + 1, right, depth + 1);
|
|
}
|
|
|
|
function select(ids, coords, k, left, right, inc) {
|
|
|
|
while (right > left) {
|
|
if (right - left > 600) {
|
|
var n = right - left + 1;
|
|
var m = k - left + 1;
|
|
var z = Math.log(n);
|
|
var s = 0.5 * Math.exp(2 * z / 3);
|
|
var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
|
|
var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
|
|
var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
|
|
select(ids, coords, k, newLeft, newRight, inc);
|
|
}
|
|
|
|
var t = coords[2 * k + inc];
|
|
var i = left;
|
|
var j = right;
|
|
|
|
swapItem(ids, coords, left, k);
|
|
if (coords[2 * right + inc] > t) { swapItem(ids, coords, left, right); }
|
|
|
|
while (i < j) {
|
|
swapItem(ids, coords, i, j);
|
|
i++;
|
|
j--;
|
|
while (coords[2 * i + inc] < t) { i++; }
|
|
while (coords[2 * j + inc] > t) { j--; }
|
|
}
|
|
|
|
if (coords[2 * left + inc] === t) { swapItem(ids, coords, left, j); }
|
|
else {
|
|
j++;
|
|
swapItem(ids, coords, j, right);
|
|
}
|
|
|
|
if (j <= k) { left = j + 1; }
|
|
if (k <= j) { right = j - 1; }
|
|
}
|
|
}
|
|
|
|
function swapItem(ids, coords, i, j) {
|
|
swap(ids, i, j);
|
|
swap(coords, 2 * i, 2 * j);
|
|
swap(coords, 2 * i + 1, 2 * j + 1);
|
|
}
|
|
|
|
function swap(arr, i, j) {
|
|
var tmp = arr[i];
|
|
arr[i] = arr[j];
|
|
arr[j] = tmp;
|
|
}
|
|
|
|
function range(ids, coords, minX, minY, maxX, maxY, nodeSize) {
|
|
var stack = [0, ids.length - 1, 0];
|
|
var result = [];
|
|
var x, y;
|
|
|
|
while (stack.length) {
|
|
var axis = stack.pop();
|
|
var right = stack.pop();
|
|
var left = stack.pop();
|
|
|
|
if (right - left <= nodeSize) {
|
|
for (var i = left; i <= right; i++) {
|
|
x = coords[2 * i];
|
|
y = coords[2 * i + 1];
|
|
if (x >= minX && x <= maxX && y >= minY && y <= maxY) { result.push(ids[i]); }
|
|
}
|
|
continue;
|
|
}
|
|
|
|
var m = Math.floor((left + right) / 2);
|
|
|
|
x = coords[2 * m];
|
|
y = coords[2 * m + 1];
|
|
|
|
if (x >= minX && x <= maxX && y >= minY && y <= maxY) { result.push(ids[m]); }
|
|
|
|
var nextAxis = (axis + 1) % 2;
|
|
|
|
if (axis === 0 ? minX <= x : minY <= y) {
|
|
stack.push(left);
|
|
stack.push(m - 1);
|
|
stack.push(nextAxis);
|
|
}
|
|
if (axis === 0 ? maxX >= x : maxY >= y) {
|
|
stack.push(m + 1);
|
|
stack.push(right);
|
|
stack.push(nextAxis);
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
function within(ids, coords, qx, qy, r, nodeSize) {
|
|
var stack = [0, ids.length - 1, 0];
|
|
var result = [];
|
|
var r2 = r * r;
|
|
|
|
while (stack.length) {
|
|
var axis = stack.pop();
|
|
var right = stack.pop();
|
|
var left = stack.pop();
|
|
|
|
if (right - left <= nodeSize) {
|
|
for (var i = left; i <= right; i++) {
|
|
if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) { result.push(ids[i]); }
|
|
}
|
|
continue;
|
|
}
|
|
|
|
var m = Math.floor((left + right) / 2);
|
|
|
|
var x = coords[2 * m];
|
|
var y = coords[2 * m + 1];
|
|
|
|
if (sqDist(x, y, qx, qy) <= r2) { result.push(ids[m]); }
|
|
|
|
var nextAxis = (axis + 1) % 2;
|
|
|
|
if (axis === 0 ? qx - r <= x : qy - r <= y) {
|
|
stack.push(left);
|
|
stack.push(m - 1);
|
|
stack.push(nextAxis);
|
|
}
|
|
if (axis === 0 ? qx + r >= x : qy + r >= y) {
|
|
stack.push(m + 1);
|
|
stack.push(right);
|
|
stack.push(nextAxis);
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
function sqDist(ax, ay, bx, by) {
|
|
var dx = ax - bx;
|
|
var dy = ay - by;
|
|
return dx * dx + dy * dy;
|
|
}
|
|
|
|
var defaultGetX = function (p) { return p[0]; };
|
|
var defaultGetY = function (p) { return p[1]; };
|
|
|
|
var KDBush = function KDBush(points, getX, getY, nodeSize, ArrayType) {
|
|
if ( getX === void 0 ) getX = defaultGetX;
|
|
if ( getY === void 0 ) getY = defaultGetY;
|
|
if ( nodeSize === void 0 ) nodeSize = 64;
|
|
if ( ArrayType === void 0 ) ArrayType = Float64Array;
|
|
|
|
this.nodeSize = nodeSize;
|
|
this.points = points;
|
|
|
|
var IndexArrayType = points.length < 65536 ? Uint16Array : Uint32Array;
|
|
|
|
var ids = this.ids = new IndexArrayType(points.length);
|
|
var coords = this.coords = new ArrayType(points.length * 2);
|
|
|
|
for (var i = 0; i < points.length; i++) {
|
|
ids[i] = i;
|
|
coords[2 * i] = getX(points[i]);
|
|
coords[2 * i + 1] = getY(points[i]);
|
|
}
|
|
|
|
sortKD(ids, coords, nodeSize, 0, ids.length - 1, 0);
|
|
};
|
|
|
|
KDBush.prototype.range = function range$1 (minX, minY, maxX, maxY) {
|
|
return range(this.ids, this.coords, minX, minY, maxX, maxY, this.nodeSize);
|
|
};
|
|
|
|
KDBush.prototype.within = function within$1 (x, y, r) {
|
|
return within(this.ids, this.coords, x, y, r, this.nodeSize);
|
|
};
|
|
|
|
return KDBush;
|
|
|
|
})));
|
|
|