Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 | 1x 40x 7481x 7481x 7481x 7481x 7481x 7481x 7481x 7478x 59824x 59824x 59824x 59824x 59824x 59824x 59824x 59824x 7476x 7476x 7476x 59808x 7476x 154x 154x 154x 154x 154x 154x 154x 154x 154x 7557x 7557x 7557x 7557x 7557x 7557x 7557x 121x 109x 31x 31x 31x 31x 4x 4x 39x 8262x 8262x 16524x 33048x 66096x 8262x 3x 3x 3x 3x 3x 3x 3x 7476x 7476x 59808x 7476x 7476x 76x 76x 76x 336x 336x 336x 336x 336x 336x 336x 336x 336x 336x 76x 14x 14x 14x 14x 14x 14x 14x 14x 14x 42x 42x 6x 6x 6x 36x 14x 8x 8x 8x 8x 8x 6x 18x 6x 12x 6x 18x 4x 6x 1x 5x 5x 15x 10x 10x 5x 5x 3x 3x 3x 3x 3x 4x 4x 8x 8x 15x 15x 15x 3x 3x 15x 2x 1x 9x 9x 9x 9x 18x 36x 72x 72x 9x 9x 15x 8x 9x 1x 8x 8x 8x 8x 32x 32x 32x 17x 32x 8x 8x 8x 8x 2x 2x 2x 1x 1x 1x 2x 2x 1x | import * as vtkMath from 'vtk.js/Sources/Common/Core/Math';
import { vec3 } from 'gl-matrix';
import vtkPlane from 'vtk.js/Sources/Common/DataModel/Plane';
const INIT_BOUNDS = [
Number.MAX_VALUE,
-Number.MAX_VALUE, // X
Number.MAX_VALUE,
-Number.MAX_VALUE, // Y
Number.MAX_VALUE,
-Number.MAX_VALUE, // Z
];
// ----------------------------------------------------------------------------
// Global methods
// ----------------------------------------------------------------------------
export function equals(a, b) {
return (
a[0] === b[0] &&
a[1] === b[1] &&
a[2] === b[2] &&
a[3] === b[3] &&
a[4] === b[4] &&
a[5] === b[5]
);
}
export function isValid(bounds) {
return (
bounds?.length >= 6 &&
bounds[0] <= bounds[1] &&
bounds[2] <= bounds[3] &&
bounds[4] <= bounds[5]
);
}
export function setBounds(bounds, otherBounds) {
bounds[0] = otherBounds[0];
bounds[1] = otherBounds[1];
bounds[2] = otherBounds[2];
bounds[3] = otherBounds[3];
bounds[4] = otherBounds[4];
bounds[5] = otherBounds[5];
return bounds;
}
export function reset(bounds) {
return setBounds(bounds, INIT_BOUNDS);
}
export function addPoint(bounds, x, y, z) {
const [xMin, xMax, yMin, yMax, zMin, zMax] = bounds;
bounds[0] = xMin < x ? xMin : x;
bounds[1] = xMax > x ? xMax : x;
bounds[2] = yMin < y ? yMin : y;
bounds[3] = yMax > y ? yMax : y;
bounds[4] = zMin < z ? zMin : z;
bounds[5] = zMax > z ? zMax : z;
return bounds;
}
export function addPoints(bounds, points) {
Iif (points.length === 0) {
return bounds;
}
if (Array.isArray(points[0])) {
for (let i = 0; i < points.length; ++i) {
addPoint(bounds, ...points[i]);
}
} else E{
for (let i = 0; i < points.length; i += 3) {
addPoint(bounds, ...points.slice(i, i + 3));
}
}
return bounds;
}
export function addBounds(bounds, xMin, xMax, yMin, yMax, zMin, zMax) {
const [_xMin, _xMax, _yMin, _yMax, _zMin, _zMax] = bounds;
Iif (zMax === undefined) {
bounds[0] = Math.min(xMin[0], _xMin);
bounds[1] = Math.max(xMin[1], _xMax);
bounds[2] = Math.min(xMin[2], _yMin);
bounds[3] = Math.max(xMin[3], _yMax);
bounds[4] = Math.min(xMin[4], _zMin);
bounds[5] = Math.max(xMin[5], _zMax);
} else {
bounds[0] = Math.min(xMin, _xMin);
bounds[1] = Math.max(xMax, _xMax);
bounds[2] = Math.min(yMin, _yMin);
bounds[3] = Math.max(yMax, _yMax);
bounds[4] = Math.min(zMin, _zMin);
bounds[5] = Math.max(zMax, _zMax);
}
return bounds;
}
export function setMinPoint(bounds, x, y, z) {
const [xMin, xMax, yMin, yMax, zMin, zMax] = bounds;
bounds[0] = x;
bounds[1] = x > xMax ? x : xMax;
bounds[2] = y;
bounds[3] = y > yMax ? y : yMax;
bounds[4] = z;
bounds[5] = z > zMax ? z : zMax;
return xMin !== x || yMin !== y || zMin !== z;
}
export function setMaxPoint(bounds, x, y, z) {
const [xMin, xMax, yMin, yMax, zMin, zMax] = bounds;
bounds[0] = x < xMin ? x : xMin;
bounds[1] = x;
bounds[2] = y < yMin ? y : yMin;
bounds[3] = y;
bounds[4] = z < zMin ? z : zMin;
bounds[5] = z;
return xMax !== x || yMax !== y || zMax !== z;
}
export function inflate(bounds, delta) {
bounds[0] -= delta;
bounds[1] += delta;
bounds[2] -= delta;
bounds[3] += delta;
bounds[4] -= delta;
bounds[5] += delta;
return bounds;
}
export function scale(bounds, sx, sy, sz) {
if (!isValid(bounds)) {
return false;
}
if (sx >= 0.0) {
bounds[0] *= sx;
bounds[1] *= sx;
} else {
bounds[0] = sx * bounds[1];
bounds[1] = sx * bounds[0];
}
if (sy >= 0.0) {
bounds[2] *= sy;
bounds[3] *= sy;
} else {
bounds[2] = sy * bounds[3];
bounds[3] = sy * bounds[2];
}
if (sz >= 0.0) {
bounds[4] *= sz;
bounds[5] *= sz;
} else {
bounds[4] = sz * bounds[5];
bounds[5] = sz * bounds[4];
}
return true;
}
export function getCenter(bounds) {
return [
0.5 * (bounds[0] + bounds[1]),
0.5 * (bounds[2] + bounds[3]),
0.5 * (bounds[4] + bounds[5]),
];
}
export function scaleAboutCenter(bounds, sx, sy, sz) {
if (!isValid(bounds)) {
return false;
}
const center = getCenter(bounds);
bounds[0] -= center[0];
bounds[1] -= center[0];
bounds[2] -= center[1];
bounds[3] -= center[1];
bounds[4] -= center[2];
bounds[5] -= center[2];
scale(bounds, sx, sy, sz);
bounds[0] += center[0];
bounds[1] += center[0];
bounds[2] += center[1];
bounds[3] += center[1];
bounds[4] += center[2];
bounds[5] += center[2];
return true;
}
export function getLength(bounds, index) {
return bounds[index * 2 + 1] - bounds[index * 2];
}
export function getLengths(bounds) {
return [getLength(bounds, 0), getLength(bounds, 1), getLength(bounds, 2)];
}
export function getXRange(bounds) {
return bounds.slice(0, 2);
}
export function getYRange(bounds) {
return bounds.slice(2, 4);
}
export function getZRange(bounds) {
return bounds.slice(4, 6);
}
export function getMaxLength(bounds) {
const l = getLengths(bounds);
if (l[0] > l[1]) {
if (l[0] > l[2]) {
return l[0];
}
return l[2];
}
if (l[1] > l[2]) {
return l[1];
}
return l[2];
}
export function getDiagonalLength(bounds) {
if (isValid(bounds)) {
const l = getLengths(bounds);
return Math.sqrt(l[0] * l[0] + l[1] * l[1] + l[2] * l[2]);
}
return null;
}
export function getMinPoint(bounds) {
return [bounds[0], bounds[2], bounds[4]];
}
export function getMaxPoint(bounds) {
return [bounds[1], bounds[3], bounds[5]];
}
function oppositeSign(a, b) {
return (a <= 0 && b >= 0) || (a >= 0 && b <= 0);
}
export function getCorners(bounds, corners) {
let count = 0;
for (let ix = 0; ix < 2; ix++) {
for (let iy = 2; iy < 4; iy++) {
for (let iz = 4; iz < 6; iz++) {
corners[count++] = [bounds[ix], bounds[iy], bounds[iz]];
}
}
}
return corners;
}
// Computes the two corners with minimal and maximal coordinates
export function computeCornerPoints(bounds, point1, point2) {
point1[0] = bounds[0];
point1[1] = bounds[2];
point1[2] = bounds[4];
point2[0] = bounds[1];
point2[1] = bounds[3];
point2[2] = bounds[5];
return point1;
}
export function transformBounds(bounds, transform, out = []) {
const corners = getCorners(bounds, []);
for (let i = 0; i < corners.length; ++i) {
vec3.transformMat4(corners[i], corners[i], transform);
}
reset(out);
return addPoints(out, corners);
}
export function computeScale3(bounds, scale3 = []) {
scale3[0] = 0.5 * (bounds[1] - bounds[0]);
scale3[1] = 0.5 * (bounds[3] - bounds[2]);
scale3[2] = 0.5 * (bounds[5] - bounds[4]);
return scale3;
}
/**
* Compute local bounds.
* Not as fast as vtkPoints.getBounds() if u, v, w form a natural basis.
* @param {vtkPoints} points
* @param {array} u first vector
* @param {array} v second vector
* @param {array} w third vector
*/
export function computeLocalBounds(points, u, v, w) {
const bounds = [].concat(INIT_BOUNDS);
const pointsData = points.getData();
for (let i = 0; i < pointsData.length; i += 3) {
const point = [pointsData[i], pointsData[i + 1], pointsData[i + 2]];
const du = vtkMath.dot(point, u);
bounds[0] = Math.min(du, bounds[0]);
bounds[1] = Math.max(du, bounds[1]);
const dv = vtkMath.dot(point, v);
bounds[2] = Math.min(dv, bounds[2]);
bounds[3] = Math.max(dv, bounds[3]);
const dw = vtkMath.dot(point, w);
bounds[4] = Math.min(dw, bounds[4]);
bounds[5] = Math.max(dw, bounds[5]);
}
return bounds;
}
// The method returns a non-zero value if the bounding box is hit.
// Origin[3] starts the ray, dir[3] is the vector components of the ray in the x-y-z
// directions, coord[3] is the location of hit, and t is the parametric
// coordinate along line. (Notes: the intersection ray dir[3] is NOT
// normalized. Valid intersections will only occur between 0<=t<=1.)
export function intersectBox(bounds, origin, dir, coord, tolerance) {
let inside = true;
const quadrant = [];
let whichPlane = 0;
const maxT = [];
const candidatePlane = [0.0, 0.0, 0.0];
const RIGHT = 0;
const LEFT = 1;
const MIDDLE = 2;
// First find closest planes
for (let i = 0; i < 3; i++) {
Iif (origin[i] < bounds[2 * i]) {
quadrant[i] = LEFT;
candidatePlane[i] = bounds[2 * i];
inside = false;
} else if (origin[i] > bounds[2 * i + 1]) {
quadrant[i] = RIGHT;
candidatePlane[i] = bounds[2 * i + 1];
inside = false;
} else {
quadrant[i] = MIDDLE;
}
}
// Check whether origin of ray is inside bbox
if (inside) {
coord[0] = origin[0];
coord[1] = origin[1];
coord[2] = origin[2];
tolerance[0] = 0;
return 1;
}
// Calculate parametric distance to plane
for (let i = 0; i < 3; i++) {
if (quadrant[i] !== MIDDLE && dir[i] !== 0.0) {
maxT[i] = (candidatePlane[i] - origin[i]) / dir[i];
} else {
maxT[i] = -1.0;
}
}
// Find the largest parametric value of intersection
for (let i = 0; i < 3; i++) {
if (maxT[whichPlane] < maxT[i]) {
whichPlane = i;
}
}
// Check for value intersection along line
if (maxT[whichPlane] > 1.0 || maxT[whichPlane] < 0.0) {
return 0;
}
tolerance[0] = maxT[whichPlane];
// Intersection point along line is okay. Check bbox.
for (let i = 0; i < 3; i++) {
if (whichPlane !== i) {
coord[i] = origin[i] + maxT[whichPlane] * dir[i];
Iif (coord[i] < bounds[2 * i] || coord[i] > bounds[2 * i + 1]) {
return 0;
}
} else {
coord[i] = candidatePlane[i];
}
}
return 1;
}
// Plane intersection with box
// The plane is infinite in extent and defined by an origin and normal.The function indicates
// whether the plane intersects, not the particulars of intersection points and such
// The function returns non-zero if the plane and box intersect; zero otherwise.
export function intersectPlane(bounds, origin, normal) {
const p = [];
let d = 0;
let sign = 1;
let firstOne = 1;
// Evaluate the eight points. If there is a sign change, there is an intersection
for (let z = 4; z <= 5; ++z) {
p[2] = bounds[z];
for (let y = 2; y <= 3; ++y) {
p[1] = bounds[y];
for (let x = 0; x <= 1; ++x) {
p[0] = bounds[x];
d = vtkPlane.evaluate(normal, origin, p);
if (firstOne) {
sign = d >= 0 ? 1 : -1;
firstOne = 0;
}
if (d === 0.0 || (sign > 0 && d < 0.0) || (sign < 0 && d > 0.0)) {
return 1;
}
}
}
}
return 0; // no intersection
}
export function intersect(bounds, bBounds) {
if (!(isValid(bounds) && isValid(bBounds))) {
return false;
}
const newBounds = [0, 0, 0, 0, 0, 0];
let intersection;
for (let i = 0; i < 3; i++) {
intersection = false;
if (
bBounds[i * 2] >= bounds[i * 2] &&
bBounds[i * 2] <= bounds[i * 2 + 1]
) {
intersection = true;
newBounds[i * 2] = bBounds[i * 2];
} else if (
bounds[i * 2] >= bBounds[i * 2] &&
bounds[i * 2] <= bBounds[i * 2 + 1]
) {
intersection = true;
newBounds[i * 2] = bounds[i * 2];
}
if (
bBounds[i * 2 + 1] >= bounds[i * 2] &&
bBounds[i * 2 + 1] <= bounds[i * 2 + 1]
) {
intersection = true;
newBounds[i * 2 + 1] = bBounds[2 * i + 1];
} else if (
bounds[i * 2 + 1] >= bBounds[i * 2] &&
bounds[i * 2 + 1] <= bBounds[i * 2 + 1]
) {
intersection = true;
newBounds[i * 2 + 1] = bounds[i * 2 + 1];
}
if (!intersection) {
return false;
}
}
// OK they did intersect - set the box to be the result
bounds[0] = newBounds[0];
bounds[1] = newBounds[1];
bounds[2] = newBounds[2];
bounds[3] = newBounds[3];
bounds[4] = newBounds[4];
bounds[5] = newBounds[5];
return true;
}
export function intersects(bounds, bBounds) {
if (!(isValid(bounds) && isValid(bBounds))) {
return false;
}
/* eslint-disable no-continue */
for (let i = 0; i < 3; i++) {
if (
bBounds[i * 2] >= bounds[i * 2] &&
bBounds[i * 2] <= bounds[i * 2 + 1]
) {
continue;
} else if (
bounds[i * 2] >= bBounds[i * 2] &&
bounds[i * 2] <= bBounds[i * 2 + 1]
) {
continue;
}
if (
bBounds[i * 2 + 1] >= bounds[i * 2] &&
bBounds[i * 2 + 1] <= bounds[i * 2 + 1]
) {
continue;
} else if (
bounds[i * 2 + 1] >= bBounds[i * 2] &&
bounds[i * 2 + 1] <= bBounds[i * 2 + 1]
) {
continue;
}
return false;
}
/* eslint-enable no-continue */
return true;
}
export function containsPoint(bounds, x, y, z) {
if (x < bounds[0] || x > bounds[1]) {
return false;
}
if (y < bounds[2] || y > bounds[3]) {
return false;
}
if (z < bounds[4] || z > bounds[5]) {
return false;
}
return true;
}
export function contains(bounds, otherBounds) {
// if either box is not valid or they don't intersect
if (!intersects(bounds, otherBounds)) {
return false;
}
if (!containsPoint(bounds, ...getMinPoint(otherBounds))) {
return false;
}
if (!containsPoint(bounds, ...getMaxPoint(otherBounds))) {
return false;
}
return true;
}
/**
* Returns true if plane intersects bounding box.
* If so, the box is cut by the plane
* @param {array} origin
* @param {array} normal
*/
export function cutWithPlane(bounds, origin, normal) {
// Index[0..2] represents the order of traversing the corners of a cube
// in (x,y,z), (y,x,z) and (z,x,y) ordering, respectively
const index = [
[0, 1, 2, 3, 4, 5, 6, 7],
[0, 1, 4, 5, 2, 3, 6, 7],
[0, 2, 4, 6, 1, 3, 5, 7],
];
// stores the signed distance to a plane
const d = [0, 0, 0, 0, 0, 0, 0, 0];
let idx = 0;
for (let ix = 0; ix < 2; ix++) {
for (let iy = 2; iy < 4; iy++) {
for (let iz = 4; iz < 6; iz++) {
const x = [bounds[ix], bounds[iy], bounds[iz]];
d[idx++] = vtkPlane.evaluate(normal, origin, x);
}
}
}
let dir = 2;
while (dir--) {
// in each direction, we test if the vertices of two orthogonal faces
// are on either side of the plane
if (
oppositeSign(d[index[dir][0]], d[index[dir][4]]) &&
oppositeSign(d[index[dir][1]], d[index[dir][5]]) &&
oppositeSign(d[index[dir][2]], d[index[dir][6]]) &&
oppositeSign(d[index[dir][3]], d[index[dir][7]])
) {
break;
}
}
if (dir < 0) {
return false;
}
const sign = Math.sign(normal[dir]);
const size = Math.abs((bounds[dir * 2 + 1] - bounds[dir * 2]) * normal[dir]);
let t = sign > 0 ? 1 : 0;
/* eslint-disable no-continue */
for (let i = 0; i < 4; i++) {
Iif (size === 0) {
continue; // shouldn't happen
}
const ti = Math.abs(d[index[dir][i]]) / size;
if (sign > 0 && ti < t) {
t = ti;
}
Iif (sign < 0 && ti > t) {
t = ti;
}
}
/* eslint-enable no-continue */
const bound = (1.0 - t) * bounds[dir * 2] + t * bounds[dir * 2 + 1];
if (sign > 0) {
bounds[dir * 2] = bound;
} else E{
bounds[dir * 2 + 1] = bound;
}
return true;
}
// ----------------------------------------------------------------------------
// Light Weight class
// ----------------------------------------------------------------------------
class BoundingBox {
constructor(refBounds) {
this.bounds = refBounds;
if (!this.bounds) {
this.bounds = new Float64Array(INIT_BOUNDS);
}
}
getBounds() {
return this.bounds;
}
equals(otherBounds) {
return equals(this.bounds, otherBounds);
}
isValid() {
return isValid(this.bounds);
}
setBounds(otherBounds) {
return setBounds(this.bounds, otherBounds);
}
reset() {
return reset(this.bounds);
}
addPoint(...xyz) {
return addPoint(this.bounds, ...xyz);
}
addPoints(points) {
return addPoints(this.bounds, points);
}
addBounds(xMin, xMax, yMin, yMax, zMin, zMax) {
return addBounds(this.bounds, xMin, xMax, yMin, yMax, zMin, zMax);
}
setMinPoint(x, y, z) {
return setMinPoint(this.bounds, x, y, z);
}
setMaxPoint(x, y, z) {
return setMaxPoint(this.bounds, x, y, z);
}
inflate(delta) {
return inflate(this.bounds, delta);
}
scale(sx, sy, sz) {
return scale(this.bounds, sx, sy, sz);
}
getCenter() {
return getCenter(this.bounds);
}
getLength(index) {
return getLength(this.bounds, index);
}
getLengths() {
return getLengths(this.bounds);
}
getMaxLength() {
return getMaxLength(this.bounds);
}
getDiagonalLength() {
return getDiagonalLength(this.bounds);
}
getMinPoint() {
return getMinPoint(this.bounds);
}
getMaxPoint() {
return getMaxPoint(this.bounds);
}
getXRange() {
return getXRange(this.bounds);
}
getYRange() {
return getYRange(this.bounds);
}
getZRange() {
return getZRange(this.bounds);
}
getCorners(corners) {
return getCorners(this.bounds, corners);
}
computeCornerPoints(point1, point2) {
return computeCornerPoints(this.bounds, point1, point2);
}
computeLocalBounds(u, v, w) {
return computeLocalBounds(this.bounds, u, v, w);
}
transformBounds(transform, out = []) {
return transformBounds(this.bounds, transform, out);
}
computeScale3(scale3) {
return computeScale3(this.bounds, scale3);
}
cutWithPlane(origin, normal) {
return cutWithPlane(this.bounds, origin, normal);
}
intersectBox(origin, dir, coord, tolerance) {
return intersectBox(this.bounds, origin, dir, coord, tolerance);
}
intersectPlane(origin, normal) {
return intersectPlane(this.bounds, origin, normal);
}
intersect(otherBounds) {
return intersect(this.bounds, otherBounds);
}
intersects(otherBounds) {
return intersects(this.bounds, otherBounds);
}
containsPoint(x, y, z) {
return containsPoint(this.bounds, x, y, z);
}
contains(otherBounds) {
return intersects(this.bounds, otherBounds);
}
}
function newInstance(initialValues) {
const bounds = initialValues && initialValues.bounds;
return new BoundingBox(bounds);
}
// ----------------------------------------------------------------------------
// Static API
// ----------------------------------------------------------------------------
export const STATIC = {
equals,
isValid,
setBounds,
reset,
addPoint,
addPoints,
addBounds,
setMinPoint,
setMaxPoint,
inflate,
scale,
scaleAboutCenter,
getCenter,
getLength,
getLengths,
getMaxLength,
getDiagonalLength,
getMinPoint,
getMaxPoint,
getXRange,
getYRange,
getZRange,
getCorners,
computeCornerPoints,
computeLocalBounds,
transformBounds,
computeScale3,
cutWithPlane,
intersectBox,
intersectPlane,
intersect,
intersects,
containsPoint,
contains,
INIT_BOUNDS,
};
export default { newInstance, ...STATIC };
|