@math.gl/culling 3.6.3 → 4.0.0-alpha.2

package/dist/es5/index.js

@@ -1,102 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-Object.defineProperty(exports, "INTERSECTION", {
-  enumerable: true,
-  get: function get() {
-    return _constants.INTERSECTION;
-  }
-});
-Object.defineProperty(exports, "AxisAlignedBoundingBox", {
-  enumerable: true,
-  get: function get() {
-    return _axisAlignedBoundingBox.default;
-  }
-});
-Object.defineProperty(exports, "BoundingSphere", {
-  enumerable: true,
-  get: function get() {
-    return _boundingSphere.default;
-  }
-});
-Object.defineProperty(exports, "OrientedBoundingBox", {
-  enumerable: true,
-  get: function get() {
-    return _orientedBoundingBox.default;
-  }
-});
-Object.defineProperty(exports, "CullingVolume", {
-  enumerable: true,
-  get: function get() {
-    return _cullingVolume.default;
-  }
-});
-Object.defineProperty(exports, "Plane", {
-  enumerable: true,
-  get: function get() {
-    return _plane.default;
-  }
-});
-Object.defineProperty(exports, "_PerspectiveOffCenterFrustum", {
-  enumerable: true,
-  get: function get() {
-    return _perspectiveOffCenterFrustum.default;
-  }
-});
-Object.defineProperty(exports, "_PerspectiveFrustum", {
-  enumerable: true,
-  get: function get() {
-    return _perspectiveFrustum.default;
-  }
-});
-Object.defineProperty(exports, "makeBoundingSphereFromPoints", {
-  enumerable: true,
-  get: function get() {
-    return _boundingSphereFromPoints.default;
-  }
-});
-Object.defineProperty(exports, "makeAxisAlignedBoundingBoxFromPoints", {
-  enumerable: true,
-  get: function get() {
-    return _boundingBoxFromPoints.makeAxisAlignedBoundingBoxFromPoints;
-  }
-});
-Object.defineProperty(exports, "makeOrientedBoundingBoxFromPoints", {
-  enumerable: true,
-  get: function get() {
-    return _boundingBoxFromPoints.makeOrientedBoundingBoxFromPoints;
-  }
-});
-Object.defineProperty(exports, "computeEigenDecomposition", {
-  enumerable: true,
-  get: function get() {
-    return _computeEigenDecomposition.default;
-  }
-});
-
-var _constants = require("./constants");
-
-var _axisAlignedBoundingBox = _interopRequireDefault(require("./lib/bounding-volumes/axis-aligned-bounding-box"));
-
-var _boundingSphere = _interopRequireDefault(require("./lib/bounding-volumes/bounding-sphere"));
-
-var _orientedBoundingBox = _interopRequireDefault(require("./lib/bounding-volumes/oriented-bounding-box"));
-
-var _cullingVolume = _interopRequireDefault(require("./lib/culling-volume"));
-
-var _plane = _interopRequireDefault(require("./lib/plane"));
-
-var _perspectiveOffCenterFrustum = _interopRequireDefault(require("./lib/perspective-off-center-frustum"));
-
-var _perspectiveFrustum = _interopRequireDefault(require("./lib/perspective-frustum"));
-
-var _boundingSphereFromPoints = _interopRequireDefault(require("./lib/algorithms/bounding-sphere-from-points"));
-
-var _boundingBoxFromPoints = require("./lib/algorithms/bounding-box-from-points");
-
-var _computeEigenDecomposition = _interopRequireDefault(require("./lib/algorithms/compute-eigen-decomposition"));
-//# sourceMappingURL=index.js.map

package/dist/es5/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAGA;;AAEA;;AACA;;AACA;;AACA;;AACA;;AAEA;;AACA;;AAEA;;AACA;;AAIA","sourcesContent":["// This file is derived from the Cesium math library under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\nexport {INTERSECTION} from './constants';\n\nexport {default as AxisAlignedBoundingBox} from './lib/bounding-volumes/axis-aligned-bounding-box';\nexport {default as BoundingSphere} from './lib/bounding-volumes/bounding-sphere';\nexport {default as OrientedBoundingBox} from './lib/bounding-volumes/oriented-bounding-box';\nexport {default as CullingVolume} from './lib/culling-volume';\nexport {default as Plane} from './lib/plane';\n\nexport {default as _PerspectiveOffCenterFrustum} from './lib/perspective-off-center-frustum';\nexport {default as _PerspectiveFrustum} from './lib/perspective-frustum';\n\nexport {default as makeBoundingSphereFromPoints} from './lib/algorithms/bounding-sphere-from-points';\nexport {\n  makeAxisAlignedBoundingBoxFromPoints,\n  makeOrientedBoundingBoxFromPoints\n} from './lib/algorithms/bounding-box-from-points';\nexport {default as computeEigenDecomposition} from './lib/algorithms/compute-eigen-decomposition';\n"],"file":"index.js"}

package/dist/es5/lib/algorithms/bounding-box-from-points.js

@@ -1,198 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.makeOrientedBoundingBoxFromPoints = makeOrientedBoundingBoxFromPoints;
-exports.makeAxisAlignedBoundingBoxFromPoints = makeAxisAlignedBoundingBoxFromPoints;
-
-var _core = require("@math.gl/core");
-
-var _computeEigenDecomposition = _interopRequireDefault(require("./compute-eigen-decomposition"));
-
-var _orientedBoundingBox = _interopRequireDefault(require("../bounding-volumes/oriented-bounding-box"));
-
-var _axisAlignedBoundingBox = _interopRequireDefault(require("../bounding-volumes/axis-aligned-bounding-box"));
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-
-var scratchVector2 = new _core.Vector3();
-var scratchVector3 = new _core.Vector3();
-var scratchVector4 = new _core.Vector3();
-var scratchVector5 = new _core.Vector3();
-var scratchVector6 = new _core.Vector3();
-var scratchCovarianceResult = new _core.Matrix3();
-var scratchEigenResult = {
-  diagonal: new _core.Matrix3(),
-  unitary: new _core.Matrix3()
-};
-
-function makeOrientedBoundingBoxFromPoints(positions) {
-  var result = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : new _orientedBoundingBox.default();
-
-  if (!positions || positions.length === 0) {
-    result.halfAxes = new _core.Matrix3([0, 0, 0, 0, 0, 0, 0, 0, 0]);
-    result.center = new _core.Vector3();
-    return result;
-  }
-
-  var length = positions.length;
-  var meanPoint = new _core.Vector3(0, 0, 0);
-
-  var _iterator = _createForOfIteratorHelper(positions),
-      _step;
-
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var position = _step.value;
-      meanPoint.add(position);
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-
-  var invLength = 1.0 / length;
-  meanPoint.multiplyByScalar(invLength);
-  var exx = 0.0;
-  var exy = 0.0;
-  var exz = 0.0;
-  var eyy = 0.0;
-  var eyz = 0.0;
-  var ezz = 0.0;
-
-  var _iterator2 = _createForOfIteratorHelper(positions),
-      _step2;
-
-  try {
-    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-      var _position = _step2.value;
-      var p = scratchVector2.copy(_position).subtract(meanPoint);
-      exx += p.x * p.x;
-      exy += p.x * p.y;
-      exz += p.x * p.z;
-      eyy += p.y * p.y;
-      eyz += p.y * p.z;
-      ezz += p.z * p.z;
-    }
-  } catch (err) {
-    _iterator2.e(err);
-  } finally {
-    _iterator2.f();
-  }
-
-  exx *= invLength;
-  exy *= invLength;
-  exz *= invLength;
-  eyy *= invLength;
-  eyz *= invLength;
-  ezz *= invLength;
-  var covarianceMatrix = scratchCovarianceResult;
-  covarianceMatrix[0] = exx;
-  covarianceMatrix[1] = exy;
-  covarianceMatrix[2] = exz;
-  covarianceMatrix[3] = exy;
-  covarianceMatrix[4] = eyy;
-  covarianceMatrix[5] = eyz;
-  covarianceMatrix[6] = exz;
-  covarianceMatrix[7] = eyz;
-  covarianceMatrix[8] = ezz;
-
-  var _computeEigenDecompos = (0, _computeEigenDecomposition.default)(covarianceMatrix, scratchEigenResult),
-      unitary = _computeEigenDecompos.unitary;
-
-  var rotation = result.halfAxes.copy(unitary);
-  var v1 = rotation.getColumn(0, scratchVector4);
-  var v2 = rotation.getColumn(1, scratchVector5);
-  var v3 = rotation.getColumn(2, scratchVector6);
-  var u1 = -Number.MAX_VALUE;
-  var u2 = -Number.MAX_VALUE;
-  var u3 = -Number.MAX_VALUE;
-  var l1 = Number.MAX_VALUE;
-  var l2 = Number.MAX_VALUE;
-  var l3 = Number.MAX_VALUE;
-
-  var _iterator3 = _createForOfIteratorHelper(positions),
-      _step3;
-
-  try {
-    for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-      var _position2 = _step3.value;
-      scratchVector2.copy(_position2);
-      u1 = Math.max(scratchVector2.dot(v1), u1);
-      u2 = Math.max(scratchVector2.dot(v2), u2);
-      u3 = Math.max(scratchVector2.dot(v3), u3);
-      l1 = Math.min(scratchVector2.dot(v1), l1);
-      l2 = Math.min(scratchVector2.dot(v2), l2);
-      l3 = Math.min(scratchVector2.dot(v3), l3);
-    }
-  } catch (err) {
-    _iterator3.e(err);
-  } finally {
-    _iterator3.f();
-  }
-
-  v1 = v1.multiplyByScalar(0.5 * (l1 + u1));
-  v2 = v2.multiplyByScalar(0.5 * (l2 + u2));
-  v3 = v3.multiplyByScalar(0.5 * (l3 + u3));
-  result.center.copy(v1).add(v2).add(v3);
-  var scale = scratchVector3.set(u1 - l1, u2 - l2, u3 - l3).multiplyByScalar(0.5);
-  var scaleMatrix = new _core.Matrix3([scale[0], 0, 0, 0, scale[1], 0, 0, 0, scale[2]]);
-  result.halfAxes.multiplyRight(scaleMatrix);
-  return result;
-}
-
-function makeAxisAlignedBoundingBoxFromPoints(positions) {
-  var result = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : new _axisAlignedBoundingBox.default();
-
-  if (!positions || positions.length === 0) {
-    result.minimum.set(0, 0, 0);
-    result.maximum.set(0, 0, 0);
-    result.center.set(0, 0, 0);
-    result.halfDiagonal.set(0, 0, 0);
-    return result;
-  }
-
-  var minimumX = positions[0][0];
-  var minimumY = positions[0][1];
-  var minimumZ = positions[0][2];
-  var maximumX = positions[0][0];
-  var maximumY = positions[0][1];
-  var maximumZ = positions[0][2];
-
-  var _iterator4 = _createForOfIteratorHelper(positions),
-      _step4;
-
-  try {
-    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
-      var p = _step4.value;
-      var x = p[0];
-      var y = p[1];
-      var z = p[2];
-      minimumX = Math.min(x, minimumX);
-      maximumX = Math.max(x, maximumX);
-      minimumY = Math.min(y, minimumY);
-      maximumY = Math.max(y, maximumY);
-      minimumZ = Math.min(z, minimumZ);
-      maximumZ = Math.max(z, maximumZ);
-    }
-  } catch (err) {
-    _iterator4.e(err);
-  } finally {
-    _iterator4.f();
-  }
-
-  result.minimum.set(minimumX, minimumY, minimumZ);
-  result.maximum.set(maximumX, maximumY, maximumZ);
-  result.center.copy(result.minimum).add(result.maximum).scale(0.5);
-  result.halfDiagonal.copy(result.maximum).subtract(result.center);
-  return result;
-}
-//# sourceMappingURL=bounding-box-from-points.js.map

package/dist/es5/lib/algorithms/bounding-box-from-points.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/lib/algorithms/bounding-box-from-points.ts"],"names":["scratchVector2","Vector3","scratchVector3","scratchVector4","scratchVector5","scratchVector6","scratchCovarianceResult","Matrix3","scratchEigenResult","diagonal","unitary","makeOrientedBoundingBoxFromPoints","positions","result","OrientedBoundingBox","length","halfAxes","center","meanPoint","position","add","invLength","multiplyByScalar","exx","exy","exz","eyy","eyz","ezz","p","copy","subtract","x","y","z","covarianceMatrix","rotation","v1","getColumn","v2","v3","u1","Number","MAX_VALUE","u2","u3","l1","l2","l3","Math","max","dot","min","scale","set","scaleMatrix","multiplyRight","makeAxisAlignedBoundingBoxFromPoints","AxisAlignedBoundingBox","minimum","maximum","halfDiagonal","minimumX","minimumY","minimumZ","maximumX","maximumY","maximumZ"],"mappings":";;;;;;;;;;AAGA;;AACA;;AACA;;AACA;;;;;;;;AAEA,IAAMA,cAAc,GAAG,IAAIC,aAAJ,EAAvB;AAEA,IAAMC,cAAc,GAAG,IAAID,aAAJ,EAAvB;AAEA,IAAME,cAAc,GAAG,IAAIF,aAAJ,EAAvB;AAEA,IAAMG,cAAc,GAAG,IAAIH,aAAJ,EAAvB;AAEA,IAAMI,cAAc,GAAG,IAAIJ,aAAJ,EAAvB;AAEA,IAAMK,uBAAuB,GAAG,IAAIC,aAAJ,EAAhC;AAEA,IAAMC,kBAAkB,GAAG;AACzBC,EAAAA,QAAQ,EAAE,IAAIF,aAAJ,EADe;AAEzBG,EAAAA,OAAO,EAAE,IAAIH,aAAJ;AAFgB,CAA3B;;AAYO,SAASI,iCAAT,CACLC,SADK,EAGgB;AAAA,MADrBC,MACqB,uEADS,IAAIC,4BAAJ,EACT;;AACrB,MAAI,CAACF,SAAD,IAAcA,SAAS,CAACG,MAAV,KAAqB,CAAvC,EAA0C;AACxCF,IAAAA,MAAM,CAACG,QAAP,GAAkB,IAAIT,aAAJ,CAAY,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,EAAU,CAAV,EAAa,CAAb,EAAgB,CAAhB,EAAmB,CAAnB,EAAsB,CAAtB,EAAyB,CAAzB,CAAZ,CAAlB;AACAM,IAAAA,MAAM,CAACI,MAAP,GAAgB,IAAIhB,aAAJ,EAAhB;AACA,WAAOY,MAAP;AACD;;AAED,MAAME,MAAM,GAAGH,SAAS,CAACG,MAAzB;AACA,MAAMG,SAAS,GAAG,IAAIjB,aAAJ,CAAY,CAAZ,EAAe,CAAf,EAAkB,CAAlB,CAAlB;;AARqB,6CASEW,SATF;AAAA;;AAAA;AASrB,wDAAkC;AAAA,UAAvBO,QAAuB;AAChCD,MAAAA,SAAS,CAACE,GAAV,CAAcD,QAAd;AACD;AAXoB;AAAA;AAAA;AAAA;AAAA;;AAYrB,MAAME,SAAS,GAAG,MAAMN,MAAxB;AACAG,EAAAA,SAAS,CAACI,gBAAV,CAA2BD,SAA3B;AAEA,MAAIE,GAAG,GAAG,GAAV;AACA,MAAIC,GAAG,GAAG,GAAV;AACA,MAAIC,GAAG,GAAG,GAAV;AACA,MAAIC,GAAG,GAAG,GAAV;AACA,MAAIC,GAAG,GAAG,GAAV;AACA,MAAIC,GAAG,GAAG,GAAV;;AApBqB,8CAsBEhB,SAtBF;AAAA;;AAAA;AAsBrB,2DAAkC;AAAA,UAAvBO,SAAuB;AAChC,UAAMU,CAAC,GAAG7B,cAAc,CAAC8B,IAAf,CAAoBX,SAApB,EAA8BY,QAA9B,CAAuCb,SAAvC,CAAV;AACAK,MAAAA,GAAG,IAAIM,CAAC,CAACG,CAAF,GAAMH,CAAC,CAACG,CAAf;AACAR,MAAAA,GAAG,IAAIK,CAAC,CAACG,CAAF,GAAMH,CAAC,CAACI,CAAf;AACAR,MAAAA,GAAG,IAAII,CAAC,CAACG,CAAF,GAAMH,CAAC,CAACK,CAAf;AACAR,MAAAA,GAAG,IAAIG,CAAC,CAACI,CAAF,GAAMJ,CAAC,CAACI,CAAf;AACAN,MAAAA,GAAG,IAAIE,CAAC,CAACI,CAAF,GAAMJ,CAAC,CAACK,CAAf;AACAN,MAAAA,GAAG,IAAIC,CAAC,CAACK,CAAF,GAAML,CAAC,CAACK,CAAf;AACD;AA9BoB;AAAA;AAAA;AAAA;AAAA;;AAgCrBX,EAAAA,GAAG,IAAIF,SAAP;AACAG,EAAAA,GAAG,IAAIH,SAAP;AACAI,EAAAA,GAAG,IAAIJ,SAAP;AACAK,EAAAA,GAAG,IAAIL,SAAP;AACAM,EAAAA,GAAG,IAAIN,SAAP;AACAO,EAAAA,GAAG,IAAIP,SAAP;AAEA,MAAMc,gBAAgB,GAAG7B,uBAAzB;AACA6B,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBZ,GAAtB;AACAY,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBX,GAAtB;AACAW,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBV,GAAtB;AACAU,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBX,GAAtB;AACAW,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBT,GAAtB;AACAS,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBR,GAAtB;AACAQ,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBV,GAAtB;AACAU,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBR,GAAtB;AACAQ,EAAAA,gBAAgB,CAAC,CAAD,CAAhB,GAAsBP,GAAtB;;AAEA,8BAAkB,wCAA0BO,gBAA1B,EAA4C3B,kBAA5C,CAAlB;AAAA,MAAOE,OAAP,yBAAOA,OAAP;;AACA,MAAM0B,QAAQ,GAAGvB,MAAM,CAACG,QAAP,CAAgBc,IAAhB,CAAqBpB,OAArB,CAAjB;AAEA,MAAI2B,EAAE,GAAGD,QAAQ,CAACE,SAAT,CAAmB,CAAnB,EAAsBnC,cAAtB,CAAT;AACA,MAAIoC,EAAE,GAAGH,QAAQ,CAACE,SAAT,CAAmB,CAAnB,EAAsBlC,cAAtB,CAAT;AACA,MAAIoC,EAAE,GAAGJ,QAAQ,CAACE,SAAT,CAAmB,CAAnB,EAAsBjC,cAAtB,CAAT;AAEA,MAAIoC,EAAE,GAAG,CAACC,MAAM,CAACC,SAAjB;AACA,MAAIC,EAAE,GAAG,CAACF,MAAM,CAACC,SAAjB;AACA,MAAIE,EAAE,GAAG,CAACH,MAAM,CAACC,SAAjB;AACA,MAAIG,EAAE,GAAGJ,MAAM,CAACC,SAAhB;AACA,MAAII,EAAE,GAAGL,MAAM,CAACC,SAAhB;AACA,MAAIK,EAAE,GAAGN,MAAM,CAACC,SAAhB;;AA9DqB,8CAgEE/B,SAhEF;AAAA;;AAAA;AAgErB,2DAAkC;AAAA,UAAvBO,UAAuB;AAChCnB,MAAAA,cAAc,CAAC8B,IAAf,CAAoBX,UAApB;AAEAsB,MAAAA,EAAE,GAAGQ,IAAI,CAACC,GAAL,CAASlD,cAAc,CAACmD,GAAf,CAAmBd,EAAnB,CAAT,EAAiCI,EAAjC,CAAL;AACAG,MAAAA,EAAE,GAAGK,IAAI,CAACC,GAAL,CAASlD,cAAc,CAACmD,GAAf,CAAmBZ,EAAnB,CAAT,EAAiCK,EAAjC,CAAL;AACAC,MAAAA,EAAE,GAAGI,IAAI,CAACC,GAAL,CAASlD,cAAc,CAACmD,GAAf,CAAmBX,EAAnB,CAAT,EAAiCK,EAAjC,CAAL;AAEAC,MAAAA,EAAE,GAAGG,IAAI,CAACG,GAAL,CAASpD,cAAc,CAACmD,GAAf,CAAmBd,EAAnB,CAAT,EAAiCS,EAAjC,CAAL;AACAC,MAAAA,EAAE,GAAGE,IAAI,CAACG,GAAL,CAASpD,cAAc,CAACmD,GAAf,CAAmBZ,EAAnB,CAAT,EAAiCQ,EAAjC,CAAL;AACAC,MAAAA,EAAE,GAAGC,IAAI,CAACG,GAAL,CAASpD,cAAc,CAACmD,GAAf,CAAmBX,EAAnB,CAAT,EAAiCQ,EAAjC,CAAL;AACD;AA1EoB;AAAA;AAAA;AAAA;AAAA;;AA4ErBX,EAAAA,EAAE,GAAGA,EAAE,CAACf,gBAAH,CAAoB,OAAOwB,EAAE,GAAGL,EAAZ,CAApB,CAAL;AACAF,EAAAA,EAAE,GAAGA,EAAE,CAACjB,gBAAH,CAAoB,OAAOyB,EAAE,GAAGH,EAAZ,CAApB,CAAL;AACAJ,EAAAA,EAAE,GAAGA,EAAE,CAAClB,gBAAH,CAAoB,OAAO0B,EAAE,GAAGH,EAAZ,CAApB,CAAL;AAEAhC,EAAAA,MAAM,CAACI,MAAP,CAAca,IAAd,CAAmBO,EAAnB,EAAuBjB,GAAvB,CAA2BmB,EAA3B,EAA+BnB,GAA/B,CAAmCoB,EAAnC;AAEA,MAAMa,KAAK,GAAGnD,cAAc,CAACoD,GAAf,CAAmBb,EAAE,GAAGK,EAAxB,EAA4BF,EAAE,GAAGG,EAAjC,EAAqCF,EAAE,GAAGG,EAA1C,EAA8C1B,gBAA9C,CAA+D,GAA/D,CAAd;AACA,MAAMiC,WAAW,GAAG,IAAIhD,aAAJ,CAAY,CAAC8C,KAAK,CAAC,CAAD,CAAN,EAAW,CAAX,EAAc,CAAd,EAAiB,CAAjB,EAAoBA,KAAK,CAAC,CAAD,CAAzB,EAA8B,CAA9B,EAAiC,CAAjC,EAAoC,CAApC,EAAuCA,KAAK,CAAC,CAAD,CAA5C,CAAZ,CAApB;AACAxC,EAAAA,MAAM,CAACG,QAAP,CAAgBwC,aAAhB,CAA8BD,WAA9B;AAEA,SAAO1C,MAAP;AACD;;AAMM,SAAS4C,oCAAT,CACL7C,SADK,EAGmB;AAAA,MADxBC,MACwB,uEADS,IAAI6C,+BAAJ,EACT;;AACxB,MAAI,CAAC9C,SAAD,IAAcA,SAAS,CAACG,MAAV,KAAqB,CAAvC,EAA0C;AACxCF,IAAAA,MAAM,CAAC8C,OAAP,CAAeL,GAAf,CAAmB,CAAnB,EAAsB,CAAtB,EAAyB,CAAzB;AACAzC,IAAAA,MAAM,CAAC+C,OAAP,CAAeN,GAAf,CAAmB,CAAnB,EAAsB,CAAtB,EAAyB,CAAzB;AACAzC,IAAAA,MAAM,CAACI,MAAP,CAAcqC,GAAd,CAAkB,CAAlB,EAAqB,CAArB,EAAwB,CAAxB;AACAzC,IAAAA,MAAM,CAACgD,YAAP,CAAoBP,GAApB,CAAwB,CAAxB,EAA2B,CAA3B,EAA8B,CAA9B;AACA,WAAOzC,MAAP;AACD;;AAED,MAAIiD,QAAQ,GAAGlD,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAf;AACA,MAAImD,QAAQ,GAAGnD,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAf;AACA,MAAIoD,QAAQ,GAAGpD,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAf;AAEA,MAAIqD,QAAQ,GAAGrD,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAf;AACA,MAAIsD,QAAQ,GAAGtD,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAf;AACA,MAAIuD,QAAQ,GAAGvD,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAf;;AAfwB,8CAiBRA,SAjBQ;AAAA;;AAAA;AAiBxB,2DAA2B;AAAA,UAAhBiB,CAAgB;AACzB,UAAMG,CAAC,GAAGH,CAAC,CAAC,CAAD,CAAX;AACA,UAAMI,CAAC,GAAGJ,CAAC,CAAC,CAAD,CAAX;AACA,UAAMK,CAAC,GAAGL,CAAC,CAAC,CAAD,CAAX;AAEAiC,MAAAA,QAAQ,GAAGb,IAAI,CAACG,GAAL,CAASpB,CAAT,EAAY8B,QAAZ,CAAX;AACAG,MAAAA,QAAQ,GAAGhB,IAAI,CAACC,GAAL,CAASlB,CAAT,EAAYiC,QAAZ,CAAX;AACAF,MAAAA,QAAQ,GAAGd,IAAI,CAACG,GAAL,CAASnB,CAAT,EAAY8B,QAAZ,CAAX;AACAG,MAAAA,QAAQ,GAAGjB,IAAI,CAACC,GAAL,CAASjB,CAAT,EAAYiC,QAAZ,CAAX;AACAF,MAAAA,QAAQ,GAAGf,IAAI,CAACG,GAAL,CAASlB,CAAT,EAAY8B,QAAZ,CAAX;AACAG,MAAAA,QAAQ,GAAGlB,IAAI,CAACC,GAAL,CAAShB,CAAT,EAAYiC,QAAZ,CAAX;AACD;AA5BuB;AAAA;AAAA;AAAA;AAAA;;AA8BxBtD,EAAAA,MAAM,CAAC8C,OAAP,CAAeL,GAAf,CAAmBQ,QAAnB,EAA6BC,QAA7B,EAAuCC,QAAvC;AACAnD,EAAAA,MAAM,CAAC+C,OAAP,CAAeN,GAAf,CAAmBW,QAAnB,EAA6BC,QAA7B,EAAuCC,QAAvC;AACAtD,EAAAA,MAAM,CAACI,MAAP,CAAca,IAAd,CAAmBjB,MAAM,CAAC8C,OAA1B,EAAmCvC,GAAnC,CAAuCP,MAAM,CAAC+C,OAA9C,EAAuDP,KAAvD,CAA6D,GAA7D;AACAxC,EAAAA,MAAM,CAACgD,YAAP,CAAoB/B,IAApB,CAAyBjB,MAAM,CAAC+C,OAAhC,EAAyC7B,QAAzC,CAAkDlB,MAAM,CAACI,MAAzD;AAEA,SAAOJ,MAAP;AACD","sourcesContent":["// This file is derived from the Cesium math library under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\nimport {Vector3, Matrix3} from '@math.gl/core';\nimport computeEigenDecomposition from './compute-eigen-decomposition';\nimport OrientedBoundingBox from '../bounding-volumes/oriented-bounding-box';\nimport AxisAlignedBoundingBox from '../bounding-volumes/axis-aligned-bounding-box';\n\nconst scratchVector2 = new Vector3();\n\nconst scratchVector3 = new Vector3();\n\nconst scratchVector4 = new Vector3();\n\nconst scratchVector5 = new Vector3();\n\nconst scratchVector6 = new Vector3();\n\nconst scratchCovarianceResult = new Matrix3();\n\nconst scratchEigenResult = {\n  diagonal: new Matrix3(),\n  unitary: new Matrix3()\n};\n\n/**\n * Computes an instance of an OrientedBoundingBox of the given positions.\n *\n * This is an implementation of Stefan Gottschalk's Collision Queries using Oriented Bounding Boxes solution (PHD thesis).\n * Reference: http://gamma.cs.unc.edu/users/gottschalk/main.pdf\n */\n/* eslint-disable max-statements */\nexport function makeOrientedBoundingBoxFromPoints(\n  positions: number[][],\n  result: OrientedBoundingBox = new OrientedBoundingBox()\n): OrientedBoundingBox {\n  if (!positions || positions.length === 0) {\n    result.halfAxes = new Matrix3([0, 0, 0, 0, 0, 0, 0, 0, 0]);\n    result.center = new Vector3();\n    return result;\n  }\n\n  const length = positions.length;\n  const meanPoint = new Vector3(0, 0, 0);\n  for (const position of positions) {\n    meanPoint.add(position);\n  }\n  const invLength = 1.0 / length;\n  meanPoint.multiplyByScalar(invLength);\n\n  let exx = 0.0;\n  let exy = 0.0;\n  let exz = 0.0;\n  let eyy = 0.0;\n  let eyz = 0.0;\n  let ezz = 0.0;\n\n  for (const position of positions) {\n    const p = scratchVector2.copy(position).subtract(meanPoint);\n    exx += p.x * p.x;\n    exy += p.x * p.y;\n    exz += p.x * p.z;\n    eyy += p.y * p.y;\n    eyz += p.y * p.z;\n    ezz += p.z * p.z;\n  }\n\n  exx *= invLength;\n  exy *= invLength;\n  exz *= invLength;\n  eyy *= invLength;\n  eyz *= invLength;\n  ezz *= invLength;\n\n  const covarianceMatrix = scratchCovarianceResult;\n  covarianceMatrix[0] = exx;\n  covarianceMatrix[1] = exy;\n  covarianceMatrix[2] = exz;\n  covarianceMatrix[3] = exy;\n  covarianceMatrix[4] = eyy;\n  covarianceMatrix[5] = eyz;\n  covarianceMatrix[6] = exz;\n  covarianceMatrix[7] = eyz;\n  covarianceMatrix[8] = ezz;\n\n  const {unitary} = computeEigenDecomposition(covarianceMatrix, scratchEigenResult);\n  const rotation = result.halfAxes.copy(unitary);\n\n  let v1 = rotation.getColumn(0, scratchVector4);\n  let v2 = rotation.getColumn(1, scratchVector5);\n  let v3 = rotation.getColumn(2, scratchVector6);\n\n  let u1 = -Number.MAX_VALUE;\n  let u2 = -Number.MAX_VALUE;\n  let u3 = -Number.MAX_VALUE;\n  let l1 = Number.MAX_VALUE;\n  let l2 = Number.MAX_VALUE;\n  let l3 = Number.MAX_VALUE;\n\n  for (const position of positions) {\n    scratchVector2.copy(position);\n\n    u1 = Math.max(scratchVector2.dot(v1), u1);\n    u2 = Math.max(scratchVector2.dot(v2), u2);\n    u3 = Math.max(scratchVector2.dot(v3), u3);\n\n    l1 = Math.min(scratchVector2.dot(v1), l1);\n    l2 = Math.min(scratchVector2.dot(v2), l2);\n    l3 = Math.min(scratchVector2.dot(v3), l3);\n  }\n\n  v1 = v1.multiplyByScalar(0.5 * (l1 + u1));\n  v2 = v2.multiplyByScalar(0.5 * (l2 + u2));\n  v3 = v3.multiplyByScalar(0.5 * (l3 + u3));\n\n  result.center.copy(v1).add(v2).add(v3);\n\n  const scale = scratchVector3.set(u1 - l1, u2 - l2, u3 - l3).multiplyByScalar(0.5);\n  const scaleMatrix = new Matrix3([scale[0], 0, 0, 0, scale[1], 0, 0, 0, scale[2]]);\n  result.halfAxes.multiplyRight(scaleMatrix);\n\n  return result;\n}\n\n/**\n * Computes an instance of an AxisAlignedBoundingBox. The box is determined by\n * finding the points spaced the farthest apart on the x, y, and z axes.\n */\nexport function makeAxisAlignedBoundingBoxFromPoints(\n  positions: readonly number[][],\n  result: AxisAlignedBoundingBox = new AxisAlignedBoundingBox()\n): AxisAlignedBoundingBox {\n  if (!positions || positions.length === 0) {\n    result.minimum.set(0, 0, 0);\n    result.maximum.set(0, 0, 0);\n    result.center.set(0, 0, 0);\n    result.halfDiagonal.set(0, 0, 0);\n    return result;\n  }\n\n  let minimumX = positions[0][0];\n  let minimumY = positions[0][1];\n  let minimumZ = positions[0][2];\n\n  let maximumX = positions[0][0];\n  let maximumY = positions[0][1];\n  let maximumZ = positions[0][2];\n\n  for (const p of positions) {\n    const x = p[0];\n    const y = p[1];\n    const z = p[2];\n\n    minimumX = Math.min(x, minimumX);\n    maximumX = Math.max(x, maximumX);\n    minimumY = Math.min(y, minimumY);\n    maximumY = Math.max(y, maximumY);\n    minimumZ = Math.min(z, minimumZ);\n    maximumZ = Math.max(z, maximumZ);\n  }\n\n  result.minimum.set(minimumX, minimumY, minimumZ);\n  result.maximum.set(maximumX, maximumY, maximumZ);\n  result.center.copy(result.minimum).add(result.maximum).scale(0.5);\n  result.halfDiagonal.copy(result.maximum).subtract(result.center);\n\n  return result;\n}\n"],"file":"bounding-box-from-points.js"}

package/dist/es5/lib/algorithms/bounding-sphere-from-points.js

@@ -1,167 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = makeBoundingSphereFromPoints;
-
-var _core = require("@math.gl/core");
-
-var _boundingSphere = _interopRequireDefault(require("../bounding-volumes/bounding-sphere"));
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-
-var fromPointsXMin = new _core.Vector3();
-var fromPointsYMin = new _core.Vector3();
-var fromPointsZMin = new _core.Vector3();
-var fromPointsXMax = new _core.Vector3();
-var fromPointsYMax = new _core.Vector3();
-var fromPointsZMax = new _core.Vector3();
-var fromPointsCurrentPos = new _core.Vector3();
-var fromPointsScratch = new _core.Vector3();
-var fromPointsRitterCenter = new _core.Vector3();
-var fromPointsMinBoxPt = new _core.Vector3();
-var fromPointsMaxBoxPt = new _core.Vector3();
-var fromPointsNaiveCenterScratch = new _core.Vector3();
-var volumeConstant = 4.0 / 3.0 * Math.PI;
-
-function makeBoundingSphereFromPoints(positions) {
-  var result = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : new _boundingSphere.default();
-
-  if (!positions || positions.length === 0) {
-    return result.fromCenterRadius([0, 0, 0], 0);
-  }
-
-  var currentPos = fromPointsCurrentPos.copy(positions[0]);
-  var xMin = fromPointsXMin.copy(currentPos);
-  var yMin = fromPointsYMin.copy(currentPos);
-  var zMin = fromPointsZMin.copy(currentPos);
-  var xMax = fromPointsXMax.copy(currentPos);
-  var yMax = fromPointsYMax.copy(currentPos);
-  var zMax = fromPointsZMax.copy(currentPos);
-
-  var _iterator = _createForOfIteratorHelper(positions),
-      _step;
-
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var position = _step.value;
-      currentPos.copy(position);
-      var x = currentPos.x;
-      var y = currentPos.y;
-      var z = currentPos.z;
-
-      if (x < xMin.x) {
-        xMin.copy(currentPos);
-      }
-
-      if (x > xMax.x) {
-        xMax.copy(currentPos);
-      }
-
-      if (y < yMin.y) {
-        yMin.copy(currentPos);
-      }
-
-      if (y > yMax.y) {
-        yMax.copy(currentPos);
-      }
-
-      if (z < zMin.z) {
-        zMin.copy(currentPos);
-      }
-
-      if (z > zMax.z) {
-        zMax.copy(currentPos);
-      }
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-
-  var xSpan = fromPointsScratch.copy(xMax).subtract(xMin).magnitudeSquared();
-  var ySpan = fromPointsScratch.copy(yMax).subtract(yMin).magnitudeSquared();
-  var zSpan = fromPointsScratch.copy(zMax).subtract(zMin).magnitudeSquared();
-  var diameter1 = xMin;
-  var diameter2 = xMax;
-  var maxSpan = xSpan;
-
-  if (ySpan > maxSpan) {
-    maxSpan = ySpan;
-    diameter1 = yMin;
-    diameter2 = yMax;
-  }
-
-  if (zSpan > maxSpan) {
-    maxSpan = zSpan;
-    diameter1 = zMin;
-    diameter2 = zMax;
-  }
-
-  var ritterCenter = fromPointsRitterCenter;
-  ritterCenter.x = (diameter1.x + diameter2.x) * 0.5;
-  ritterCenter.y = (diameter1.y + diameter2.y) * 0.5;
-  ritterCenter.z = (diameter1.z + diameter2.z) * 0.5;
-  var radiusSquared = fromPointsScratch.copy(diameter2).subtract(ritterCenter).magnitudeSquared();
-  var ritterRadius = Math.sqrt(radiusSquared);
-  var minBoxPt = fromPointsMinBoxPt;
-  minBoxPt.x = xMin.x;
-  minBoxPt.y = yMin.y;
-  minBoxPt.z = zMin.z;
-  var maxBoxPt = fromPointsMaxBoxPt;
-  maxBoxPt.x = xMax.x;
-  maxBoxPt.y = yMax.y;
-  maxBoxPt.z = zMax.z;
-  var naiveCenter = fromPointsNaiveCenterScratch.copy(minBoxPt).add(maxBoxPt).multiplyByScalar(0.5);
-  var naiveRadius = 0;
-
-  var _iterator2 = _createForOfIteratorHelper(positions),
-      _step2;
-
-  try {
-    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-      var _position = _step2.value;
-      currentPos.copy(_position);
-      var r = fromPointsScratch.copy(currentPos).subtract(naiveCenter).magnitude();
-
-      if (r > naiveRadius) {
-        naiveRadius = r;
-      }
-
-      var oldCenterToPointSquared = fromPointsScratch.copy(currentPos).subtract(ritterCenter).magnitudeSquared();
-
-      if (oldCenterToPointSquared > radiusSquared) {
-        var oldCenterToPoint = Math.sqrt(oldCenterToPointSquared);
-        ritterRadius = (ritterRadius + oldCenterToPoint) * 0.5;
-        radiusSquared = ritterRadius * ritterRadius;
-        var oldToNew = oldCenterToPoint - ritterRadius;
-        ritterCenter.x = (ritterRadius * ritterCenter.x + oldToNew * currentPos.x) / oldCenterToPoint;
-        ritterCenter.y = (ritterRadius * ritterCenter.y + oldToNew * currentPos.y) / oldCenterToPoint;
-        ritterCenter.z = (ritterRadius * ritterCenter.z + oldToNew * currentPos.z) / oldCenterToPoint;
-      }
-    }
-  } catch (err) {
-    _iterator2.e(err);
-  } finally {
-    _iterator2.f();
-  }
-
-  if (ritterRadius < naiveRadius) {
-    ritterCenter.to(result.center);
-    result.radius = ritterRadius;
-  } else {
-    naiveCenter.to(result.center);
-    result.radius = naiveRadius;
-  }
-
-  return result;
-}
-//# sourceMappingURL=bounding-sphere-from-points.js.map

package/dist/es5/lib/algorithms/bounding-sphere-from-points.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/lib/algorithms/bounding-sphere-from-points.ts"],"names":["fromPointsXMin","Vector3","fromPointsYMin","fromPointsZMin","fromPointsXMax","fromPointsYMax","fromPointsZMax","fromPointsCurrentPos","fromPointsScratch","fromPointsRitterCenter","fromPointsMinBoxPt","fromPointsMaxBoxPt","fromPointsNaiveCenterScratch","volumeConstant","Math","PI","makeBoundingSphereFromPoints","positions","result","BoundingSphere","length","fromCenterRadius","currentPos","copy","xMin","yMin","zMin","xMax","yMax","zMax","position","x","y","z","xSpan","subtract","magnitudeSquared","ySpan","zSpan","diameter1","diameter2","maxSpan","ritterCenter","radiusSquared","ritterRadius","sqrt","minBoxPt","maxBoxPt","naiveCenter","add","multiplyByScalar","naiveRadius","r","magnitude","oldCenterToPointSquared","oldCenterToPoint","oldToNew","to","center","radius"],"mappings":";;;;;;;;;AAGA;;AACA;;;;;;;;AAGA,IAAMA,cAAc,GAAG,IAAIC,aAAJ,EAAvB;AACA,IAAMC,cAAc,GAAG,IAAID,aAAJ,EAAvB;AACA,IAAME,cAAc,GAAG,IAAIF,aAAJ,EAAvB;AACA,IAAMG,cAAc,GAAG,IAAIH,aAAJ,EAAvB;AACA,IAAMI,cAAc,GAAG,IAAIJ,aAAJ,EAAvB;AACA,IAAMK,cAAc,GAAG,IAAIL,aAAJ,EAAvB;AACA,IAAMM,oBAAoB,GAAG,IAAIN,aAAJ,EAA7B;AACA,IAAMO,iBAAiB,GAAG,IAAIP,aAAJ,EAA1B;AACA,IAAMQ,sBAAsB,GAAG,IAAIR,aAAJ,EAA/B;AACA,IAAMS,kBAAkB,GAAG,IAAIT,aAAJ,EAA3B;AACA,IAAMU,kBAAkB,GAAG,IAAIV,aAAJ,EAA3B;AACA,IAAMW,4BAA4B,GAAG,IAAIX,aAAJ,EAArC;AACA,IAAMY,cAAc,GAAI,MAAM,GAAP,GAAcC,IAAI,CAACC,EAA1C;;AAae,SAASC,4BAAT,CACbC,SADa,EAGG;AAAA,MADhBC,MACgB,uEADS,IAAIC,uBAAJ,EACT;;AAChB,MAAI,CAACF,SAAD,IAAcA,SAAS,CAACG,MAAV,KAAqB,CAAvC,EAA0C;AACxC,WAAOF,MAAM,CAACG,gBAAP,CAAwB,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAAxB,EAAmC,CAAnC,CAAP;AACD;;AAED,MAAMC,UAAU,GAAGf,oBAAoB,CAACgB,IAArB,CAA0BN,SAAS,CAAC,CAAD,CAAnC,CAAnB;AAEA,MAAMO,IAAI,GAAGxB,cAAc,CAACuB,IAAf,CAAoBD,UAApB,CAAb;AACA,MAAMG,IAAI,GAAGvB,cAAc,CAACqB,IAAf,CAAoBD,UAApB,CAAb;AACA,MAAMI,IAAI,GAAGvB,cAAc,CAACoB,IAAf,CAAoBD,UAApB,CAAb;AAEA,MAAMK,IAAI,GAAGvB,cAAc,CAACmB,IAAf,CAAoBD,UAApB,CAAb;AACA,MAAMM,IAAI,GAAGvB,cAAc,CAACkB,IAAf,CAAoBD,UAApB,CAAb;AACA,MAAMO,IAAI,GAAGvB,cAAc,CAACiB,IAAf,CAAoBD,UAApB,CAAb;;AAbgB,6CAeOL,SAfP;AAAA;;AAAA;AAehB,wDAAkC;AAAA,UAAvBa,QAAuB;AAChCR,MAAAA,UAAU,CAACC,IAAX,CAAgBO,QAAhB;AAEA,UAAMC,CAAC,GAAGT,UAAU,CAACS,CAArB;AACA,UAAMC,CAAC,GAAGV,UAAU,CAACU,CAArB;AACA,UAAMC,CAAC,GAAGX,UAAU,CAACW,CAArB;;AAGA,UAAIF,CAAC,GAAGP,IAAI,CAACO,CAAb,EAAgB;AACdP,QAAAA,IAAI,CAACD,IAAL,CAAUD,UAAV;AACD;;AAED,UAAIS,CAAC,GAAGJ,IAAI,CAACI,CAAb,EAAgB;AACdJ,QAAAA,IAAI,CAACJ,IAAL,CAAUD,UAAV;AACD;;AAED,UAAIU,CAAC,GAAGP,IAAI,CAACO,CAAb,EAAgB;AACdP,QAAAA,IAAI,CAACF,IAAL,CAAUD,UAAV;AACD;;AAED,UAAIU,CAAC,GAAGJ,IAAI,CAACI,CAAb,EAAgB;AACdJ,QAAAA,IAAI,CAACL,IAAL,CAAUD,UAAV;AACD;;AAED,UAAIW,CAAC,GAAGP,IAAI,CAACO,CAAb,EAAgB;AACdP,QAAAA,IAAI,CAACH,IAAL,CAAUD,UAAV;AACD;;AAED,UAAIW,CAAC,GAAGJ,IAAI,CAACI,CAAb,EAAgB;AACdJ,QAAAA,IAAI,CAACN,IAAL,CAAUD,UAAV;AACD;AACF;AA9Ce;AAAA;AAAA;AAAA;AAAA;;AAiDhB,MAAMY,KAAK,GAAG1B,iBAAiB,CAACe,IAAlB,CAAuBI,IAAvB,EAA6BQ,QAA7B,CAAsCX,IAAtC,EAA4CY,gBAA5C,EAAd;AACA,MAAMC,KAAK,GAAG7B,iBAAiB,CAACe,IAAlB,CAAuBK,IAAvB,EAA6BO,QAA7B,CAAsCV,IAAtC,EAA4CW,gBAA5C,EAAd;AACA,MAAME,KAAK,GAAG9B,iBAAiB,CAACe,IAAlB,CAAuBM,IAAvB,EAA6BM,QAA7B,CAAsCT,IAAtC,EAA4CU,gBAA5C,EAAd;AAGA,MAAIG,SAAS,GAAGf,IAAhB;AACA,MAAIgB,SAAS,GAAGb,IAAhB;AACA,MAAIc,OAAO,GAAGP,KAAd;;AACA,MAAIG,KAAK,GAAGI,OAAZ,EAAqB;AACnBA,IAAAA,OAAO,GAAGJ,KAAV;AACAE,IAAAA,SAAS,GAAGd,IAAZ;AACAe,IAAAA,SAAS,GAAGZ,IAAZ;AACD;;AACD,MAAIU,KAAK,GAAGG,OAAZ,EAAqB;AACnBA,IAAAA,OAAO,GAAGH,KAAV;AACAC,IAAAA,SAAS,GAAGb,IAAZ;AACAc,IAAAA,SAAS,GAAGX,IAAZ;AACD;;AAGD,MAAMa,YAAY,GAAGjC,sBAArB;AACAiC,EAAAA,YAAY,CAACX,CAAb,GAAiB,CAACQ,SAAS,CAACR,CAAV,GAAcS,SAAS,CAACT,CAAzB,IAA8B,GAA/C;AACAW,EAAAA,YAAY,CAACV,CAAb,GAAiB,CAACO,SAAS,CAACP,CAAV,GAAcQ,SAAS,CAACR,CAAzB,IAA8B,GAA/C;AACAU,EAAAA,YAAY,CAACT,CAAb,GAAiB,CAACM,SAAS,CAACN,CAAV,GAAcO,SAAS,CAACP,CAAzB,IAA8B,GAA/C;AAGA,MAAIU,aAAa,GAAGnC,iBAAiB,CAACe,IAAlB,CAAuBiB,SAAvB,EAAkCL,QAAlC,CAA2CO,YAA3C,EAAyDN,gBAAzD,EAApB;AACA,MAAIQ,YAAY,GAAG9B,IAAI,CAAC+B,IAAL,CAAUF,aAAV,CAAnB;AAGA,MAAMG,QAAQ,GAAGpC,kBAAjB;AACAoC,EAAAA,QAAQ,CAACf,CAAT,GAAaP,IAAI,CAACO,CAAlB;AACAe,EAAAA,QAAQ,CAACd,CAAT,GAAaP,IAAI,CAACO,CAAlB;AACAc,EAAAA,QAAQ,CAACb,CAAT,GAAaP,IAAI,CAACO,CAAlB;AAEA,MAAMc,QAAQ,GAAGpC,kBAAjB;AACAoC,EAAAA,QAAQ,CAAChB,CAAT,GAAaJ,IAAI,CAACI,CAAlB;AACAgB,EAAAA,QAAQ,CAACf,CAAT,GAAaJ,IAAI,CAACI,CAAlB;AACAe,EAAAA,QAAQ,CAACd,CAAT,GAAaJ,IAAI,CAACI,CAAlB;AAEA,MAAMe,WAAW,GAAGpC,4BAA4B,CAC7CW,IADiB,CACZuB,QADY,EAEjBG,GAFiB,CAEbF,QAFa,EAGjBG,gBAHiB,CAGA,GAHA,CAApB;AAMA,MAAIC,WAAW,GAAG,CAAlB;;AA/FgB,8CAgGOlC,SAhGP;AAAA;;AAAA;AAgGhB,2DAAkC;AAAA,UAAvBa,SAAuB;AAChCR,MAAAA,UAAU,CAACC,IAAX,CAAgBO,SAAhB;AAGA,UAAMsB,CAAC,GAAG5C,iBAAiB,CAACe,IAAlB,CAAuBD,UAAvB,EAAmCa,QAAnC,CAA4Ca,WAA5C,EAAyDK,SAAzD,EAAV;;AACA,UAAID,CAAC,GAAGD,WAAR,EAAqB;AACnBA,QAAAA,WAAW,GAAGC,CAAd;AACD;;AAGD,UAAME,uBAAuB,GAAG9C,iBAAiB,CAC9Ce,IAD6B,CACxBD,UADwB,EAE7Ba,QAF6B,CAEpBO,YAFoB,EAG7BN,gBAH6B,EAAhC;;AAKA,UAAIkB,uBAAuB,GAAGX,aAA9B,EAA6C;AAC3C,YAAMY,gBAAgB,GAAGzC,IAAI,CAAC+B,IAAL,CAAUS,uBAAV,CAAzB;AAEAV,QAAAA,YAAY,GAAG,CAACA,YAAY,GAAGW,gBAAhB,IAAoC,GAAnD;AACAZ,QAAAA,aAAa,GAAGC,YAAY,GAAGA,YAA/B;AAEA,YAAMY,QAAQ,GAAGD,gBAAgB,GAAGX,YAApC;AACAF,QAAAA,YAAY,CAACX,CAAb,GAAiB,CAACa,YAAY,GAAGF,YAAY,CAACX,CAA5B,GAAgCyB,QAAQ,GAAGlC,UAAU,CAACS,CAAvD,IAA4DwB,gBAA7E;AACAb,QAAAA,YAAY,CAACV,CAAb,GAAiB,CAACY,YAAY,GAAGF,YAAY,CAACV,CAA5B,GAAgCwB,QAAQ,GAAGlC,UAAU,CAACU,CAAvD,IAA4DuB,gBAA7E;AACAb,QAAAA,YAAY,CAACT,CAAb,GAAiB,CAACW,YAAY,GAAGF,YAAY,CAACT,CAA5B,GAAgCuB,QAAQ,GAAGlC,UAAU,CAACW,CAAvD,IAA4DsB,gBAA7E;AACD;AACF;AA1He;AAAA;AAAA;AAAA;AAAA;;AA4HhB,MAAIX,YAAY,GAAGO,WAAnB,EAAgC;AAC9BT,IAAAA,YAAY,CAACe,EAAb,CAAgBvC,MAAM,CAACwC,MAAvB;AACAxC,IAAAA,MAAM,CAACyC,MAAP,GAAgBf,YAAhB;AACD,GAHD,MAGO;AACLI,IAAAA,WAAW,CAACS,EAAZ,CAAevC,MAAM,CAACwC,MAAtB;AACAxC,IAAAA,MAAM,CAACyC,MAAP,GAAgBR,WAAhB;AACD;;AAED,SAAOjC,MAAP;AACD","sourcesContent":["// This file is derived from the Cesium math library under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\nimport {Vector3} from '@math.gl/core';\nimport BoundingSphere from '../bounding-volumes/bounding-sphere';\n\n/* eslint-disable */\nconst fromPointsXMin = new Vector3();\nconst fromPointsYMin = new Vector3();\nconst fromPointsZMin = new Vector3();\nconst fromPointsXMax = new Vector3();\nconst fromPointsYMax = new Vector3();\nconst fromPointsZMax = new Vector3();\nconst fromPointsCurrentPos = new Vector3();\nconst fromPointsScratch = new Vector3();\nconst fromPointsRitterCenter = new Vector3();\nconst fromPointsMinBoxPt = new Vector3();\nconst fromPointsMaxBoxPt = new Vector3();\nconst fromPointsNaiveCenterScratch = new Vector3();\nconst volumeConstant = (4.0 / 3.0) * Math.PI;\n\n/**\n * Computes a tight-fitting bounding sphere enclosing a list of 3D Cartesian points.\n *\n * The bounding sphere is computed by running two algorithms, a naive algorithm and\n * Ritter's algorithm. The smaller of the two spheres is used to ensure a tight fit.\n * Bounding sphere computation article http://blogs.agi.com/insight3d/index.php/2008/02/04/a-bounding\n *\n * @param positions An array of points that the bounding sphere will enclose.\n * @param result Optional object onto which to store the result.\n * @returns The modified result parameter or a new `BoundingSphere` instance if not provided.\n */\nexport default function makeBoundingSphereFromPoints(\n  positions: number[][],\n  result: BoundingSphere = new BoundingSphere()\n): BoundingSphere {\n  if (!positions || positions.length === 0) {\n    return result.fromCenterRadius([0, 0, 0], 0);\n  }\n\n  const currentPos = fromPointsCurrentPos.copy(positions[0]);\n\n  const xMin = fromPointsXMin.copy(currentPos);\n  const yMin = fromPointsYMin.copy(currentPos);\n  const zMin = fromPointsZMin.copy(currentPos);\n\n  const xMax = fromPointsXMax.copy(currentPos);\n  const yMax = fromPointsYMax.copy(currentPos);\n  const zMax = fromPointsZMax.copy(currentPos);\n\n  for (const position of positions) {\n    currentPos.copy(position);\n\n    const x = currentPos.x;\n    const y = currentPos.y;\n    const z = currentPos.z;\n\n    // Store points containing the the smallest and largest components\n    if (x < xMin.x) {\n      xMin.copy(currentPos);\n    }\n\n    if (x > xMax.x) {\n      xMax.copy(currentPos);\n    }\n\n    if (y < yMin.y) {\n      yMin.copy(currentPos);\n    }\n\n    if (y > yMax.y) {\n      yMax.copy(currentPos);\n    }\n\n    if (z < zMin.z) {\n      zMin.copy(currentPos);\n    }\n\n    if (z > zMax.z) {\n      zMax.copy(currentPos);\n    }\n  }\n\n  // Compute x-, y-, and z-spans (Squared distances b/n each component's min. and max.).\n  const xSpan = fromPointsScratch.copy(xMax).subtract(xMin).magnitudeSquared();\n  const ySpan = fromPointsScratch.copy(yMax).subtract(yMin).magnitudeSquared();\n  const zSpan = fromPointsScratch.copy(zMax).subtract(zMin).magnitudeSquared();\n\n  // Set the diameter endpoints to the largest span.\n  let diameter1 = xMin;\n  let diameter2 = xMax;\n  let maxSpan = xSpan;\n  if (ySpan > maxSpan) {\n    maxSpan = ySpan;\n    diameter1 = yMin;\n    diameter2 = yMax;\n  }\n  if (zSpan > maxSpan) {\n    maxSpan = zSpan;\n    diameter1 = zMin;\n    diameter2 = zMax;\n  }\n\n  // Calculate the center of the initial sphere found by Ritter's algorithm\n  const ritterCenter = fromPointsRitterCenter;\n  ritterCenter.x = (diameter1.x + diameter2.x) * 0.5;\n  ritterCenter.y = (diameter1.y + diameter2.y) * 0.5;\n  ritterCenter.z = (diameter1.z + diameter2.z) * 0.5;\n\n  // Calculate the radius of the initial sphere found by Ritter's algorithm\n  let radiusSquared = fromPointsScratch.copy(diameter2).subtract(ritterCenter).magnitudeSquared();\n  let ritterRadius = Math.sqrt(radiusSquared);\n\n  // Find the center of the sphere found using the Naive method.\n  const minBoxPt = fromPointsMinBoxPt;\n  minBoxPt.x = xMin.x;\n  minBoxPt.y = yMin.y;\n  minBoxPt.z = zMin.z;\n\n  const maxBoxPt = fromPointsMaxBoxPt;\n  maxBoxPt.x = xMax.x;\n  maxBoxPt.y = yMax.y;\n  maxBoxPt.z = zMax.z;\n\n  const naiveCenter = fromPointsNaiveCenterScratch\n    .copy(minBoxPt)\n    .add(maxBoxPt)\n    .multiplyByScalar(0.5);\n\n  // Begin 2nd pass to find naive radius and modify the ritter sphere.\n  let naiveRadius = 0;\n  for (const position of positions) {\n    currentPos.copy(position);\n\n    // Find the furthest point from the naive center to calculate the naive radius.\n    const r = fromPointsScratch.copy(currentPos).subtract(naiveCenter).magnitude();\n    if (r > naiveRadius) {\n      naiveRadius = r;\n    }\n\n    // Make adjustments to the Ritter Sphere to include all points.\n    const oldCenterToPointSquared = fromPointsScratch\n      .copy(currentPos)\n      .subtract(ritterCenter)\n      .magnitudeSquared();\n\n    if (oldCenterToPointSquared > radiusSquared) {\n      const oldCenterToPoint = Math.sqrt(oldCenterToPointSquared);\n      // Calculate new radius to include the point that lies outside\n      ritterRadius = (ritterRadius + oldCenterToPoint) * 0.5;\n      radiusSquared = ritterRadius * ritterRadius;\n      // Calculate center of new Ritter sphere\n      const oldToNew = oldCenterToPoint - ritterRadius;\n      ritterCenter.x = (ritterRadius * ritterCenter.x + oldToNew * currentPos.x) / oldCenterToPoint;\n      ritterCenter.y = (ritterRadius * ritterCenter.y + oldToNew * currentPos.y) / oldCenterToPoint;\n      ritterCenter.z = (ritterRadius * ritterCenter.z + oldToNew * currentPos.z) / oldCenterToPoint;\n    }\n  }\n\n  if (ritterRadius < naiveRadius) {\n    ritterCenter.to(result.center);\n    result.radius = ritterRadius;\n  } else {\n    naiveCenter.to(result.center);\n    result.radius = naiveRadius;\n  }\n\n  return result;\n}\n"],"file":"bounding-sphere-from-points.js"}

package/dist/es5/lib/algorithms/compute-eigen-decomposition.js

@@ -1,114 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = computeEigenDecomposition;
-
-var _core = require("@math.gl/core");
-
-var scratchMatrix = new _core.Matrix3();
-var scratchUnitary = new _core.Matrix3();
-var scratchDiagonal = new _core.Matrix3();
-var jMatrix = new _core.Matrix3();
-var jMatrixTranspose = new _core.Matrix3();
-
-function computeEigenDecomposition(matrix) {
-  var result = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
-  var EIGEN_TOLERANCE = _core._MathUtils.EPSILON20;
-  var EIGEN_MAX_SWEEPS = 10;
-  var count = 0;
-  var sweep = 0;
-  var unitaryMatrix = scratchUnitary;
-  var diagonalMatrix = scratchDiagonal;
-  unitaryMatrix.identity();
-  diagonalMatrix.copy(matrix);
-  var epsilon = EIGEN_TOLERANCE * computeFrobeniusNorm(diagonalMatrix);
-
-  while (sweep < EIGEN_MAX_SWEEPS && offDiagonalFrobeniusNorm(diagonalMatrix) > epsilon) {
-    shurDecomposition(diagonalMatrix, jMatrix);
-    jMatrixTranspose.copy(jMatrix).transpose();
-    diagonalMatrix.multiplyRight(jMatrix);
-    diagonalMatrix.multiplyLeft(jMatrixTranspose);
-    unitaryMatrix.multiplyRight(jMatrix);
-
-    if (++count > 2) {
-      ++sweep;
-      count = 0;
-    }
-  }
-
-  result.unitary = unitaryMatrix.toTarget(result.unitary);
-  result.diagonal = diagonalMatrix.toTarget(result.diagonal);
-  return result;
-}
-
-function computeFrobeniusNorm(matrix) {
-  var norm = 0.0;
-
-  for (var i = 0; i < 9; ++i) {
-    var temp = matrix[i];
-    norm += temp * temp;
-  }
-
-  return Math.sqrt(norm);
-}
-
-var rowVal = [1, 0, 0];
-var colVal = [2, 2, 1];
-
-function offDiagonalFrobeniusNorm(matrix) {
-  var norm = 0.0;
-
-  for (var i = 0; i < 3; ++i) {
-    var temp = matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])];
-    norm += 2.0 * temp * temp;
-  }
-
-  return Math.sqrt(norm);
-}
-
-function shurDecomposition(matrix, result) {
-  var tolerance = _core._MathUtils.EPSILON15;
-  var maxDiagonal = 0.0;
-  var rotAxis = 1;
-
-  for (var i = 0; i < 3; ++i) {
-    var temp = Math.abs(matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])]);
-
-    if (temp > maxDiagonal) {
-      rotAxis = i;
-      maxDiagonal = temp;
-    }
-  }
-
-  var p = rowVal[rotAxis];
-  var q = colVal[rotAxis];
-  var c = 1.0;
-  var s = 0.0;
-
-  if (Math.abs(matrix[scratchMatrix.getElementIndex(q, p)]) > tolerance) {
-    var qq = matrix[scratchMatrix.getElementIndex(q, q)];
-    var pp = matrix[scratchMatrix.getElementIndex(p, p)];
-    var qp = matrix[scratchMatrix.getElementIndex(q, p)];
-    var tau = (qq - pp) / 2.0 / qp;
-    var t;
-
-    if (tau < 0.0) {
-      t = -1.0 / (-tau + Math.sqrt(1.0 + tau * tau));
-    } else {
-      t = 1.0 / (tau + Math.sqrt(1.0 + tau * tau));
-    }
-
-    c = 1.0 / Math.sqrt(1.0 + t * t);
-    s = t * c;
-  }
-
-  _core.Matrix3.IDENTITY.to(result);
-
-  result[scratchMatrix.getElementIndex(p, p)] = result[scratchMatrix.getElementIndex(q, q)] = c;
-  result[scratchMatrix.getElementIndex(q, p)] = s;
-  result[scratchMatrix.getElementIndex(p, q)] = -s;
-  return result;
-}
-//# sourceMappingURL=compute-eigen-decomposition.js.map

package/dist/es5/lib/algorithms/compute-eigen-decomposition.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/lib/algorithms/compute-eigen-decomposition.ts"],"names":["scratchMatrix","Matrix3","scratchUnitary","scratchDiagonal","jMatrix","jMatrixTranspose","computeEigenDecomposition","matrix","result","EIGEN_TOLERANCE","_MathUtils","EPSILON20","EIGEN_MAX_SWEEPS","count","sweep","unitaryMatrix","diagonalMatrix","identity","copy","epsilon","computeFrobeniusNorm","offDiagonalFrobeniusNorm","shurDecomposition","transpose","multiplyRight","multiplyLeft","unitary","toTarget","diagonal","norm","i","temp","Math","sqrt","rowVal","colVal","getElementIndex","tolerance","EPSILON15","maxDiagonal","rotAxis","abs","p","q","c","s","qq","pp","qp","tau","t","IDENTITY","to"],"mappings":";;;;;;;AAGA;;AAEA,IAAMA,aAAa,GAAG,IAAIC,aAAJ,EAAtB;AACA,IAAMC,cAAc,GAAG,IAAID,aAAJ,EAAvB;AACA,IAAME,eAAe,GAAG,IAAIF,aAAJ,EAAxB;AAEA,IAAMG,OAAO,GAAG,IAAIH,aAAJ,EAAhB;AACA,IAAMI,gBAAgB,GAAG,IAAIJ,aAAJ,EAAzB;;AAqCe,SAASK,yBAAT,CACbC,MADa,EAIO;AAAA,MADpBC,MACoB,uEADS,EACT;AACpB,MAAMC,eAAe,GAAGC,iBAAWC,SAAnC;AACA,MAAMC,gBAAgB,GAAG,EAAzB;AAEA,MAAIC,KAAK,GAAG,CAAZ;AACA,MAAIC,KAAK,GAAG,CAAZ;AAEA,MAAMC,aAAa,GAAGb,cAAtB;AACA,MAAMc,cAAc,GAAGb,eAAvB;AAEAY,EAAAA,aAAa,CAACE,QAAd;AACAD,EAAAA,cAAc,CAACE,IAAf,CAAoBX,MAApB;AAEA,MAAMY,OAAO,GAAGV,eAAe,GAAGW,oBAAoB,CAACJ,cAAD,CAAtD;;AAEA,SAAOF,KAAK,GAAGF,gBAAR,IAA4BS,wBAAwB,CAACL,cAAD,CAAxB,GAA2CG,OAA9E,EAAuF;AACrFG,IAAAA,iBAAiB,CAACN,cAAD,EAAiBZ,OAAjB,CAAjB;AAEAC,IAAAA,gBAAgB,CAACa,IAAjB,CAAsBd,OAAtB,EAA+BmB,SAA/B;AAEAP,IAAAA,cAAc,CAACQ,aAAf,CAA6BpB,OAA7B;AACAY,IAAAA,cAAc,CAACS,YAAf,CAA4BpB,gBAA5B;AACAU,IAAAA,aAAa,CAACS,aAAd,CAA4BpB,OAA5B;;AAEA,QAAI,EAAES,KAAF,GAAU,CAAd,EAAiB;AACf,QAAEC,KAAF;AACAD,MAAAA,KAAK,GAAG,CAAR;AACD;AACF;;AAEDL,EAAAA,MAAM,CAACkB,OAAP,GAAiBX,aAAa,CAACY,QAAd,CAAuBnB,MAAM,CAACkB,OAA9B,CAAjB;AACAlB,EAAAA,MAAM,CAACoB,QAAP,GAAkBZ,cAAc,CAACW,QAAf,CAAwBnB,MAAM,CAACoB,QAA/B,CAAlB;AAEA,SAAOpB,MAAP;AACD;;AAED,SAASY,oBAAT,CAA8Bb,MAA9B,EAAuD;AACrD,MAAIsB,IAAI,GAAG,GAAX;;AACA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuB,EAAEA,CAAzB,EAA4B;AAC1B,QAAMC,IAAI,GAAGxB,MAAM,CAACuB,CAAD,CAAnB;AACAD,IAAAA,IAAI,IAAIE,IAAI,GAAGA,IAAf;AACD;;AACD,SAAOC,IAAI,CAACC,IAAL,CAAUJ,IAAV,CAAP;AACD;;AAED,IAAMK,MAAM,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAAf;AACA,IAAMC,MAAM,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAAf;;AAIA,SAASd,wBAAT,CAAkCd,MAAlC,EAA2D;AACzD,MAAIsB,IAAI,GAAG,GAAX;;AACA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuB,EAAEA,CAAzB,EAA4B;AAC1B,QAAMC,IAAI,GAAGxB,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BD,MAAM,CAACL,CAAD,CAApC,EAAyCI,MAAM,CAACJ,CAAD,CAA/C,CAAD,CAAnB;AACAD,IAAAA,IAAI,IAAI,MAAME,IAAN,GAAaA,IAArB;AACD;;AACD,SAAOC,IAAI,CAACC,IAAL,CAAUJ,IAAV,CAAP;AACD;;AAUD,SAASP,iBAAT,CAA2Bf,MAA3B,EAA4CC,MAA5C,EAAsE;AACpE,MAAM6B,SAAS,GAAG3B,iBAAW4B,SAA7B;AAEA,MAAIC,WAAW,GAAG,GAAlB;AACA,MAAIC,OAAO,GAAG,CAAd;;AAGA,OAAK,IAAIV,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuB,EAAEA,CAAzB,EAA4B;AAC1B,QAAMC,IAAI,GAAGC,IAAI,CAACS,GAAL,CAASlC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BD,MAAM,CAACL,CAAD,CAApC,EAAyCI,MAAM,CAACJ,CAAD,CAA/C,CAAD,CAAf,CAAb;;AACA,QAAIC,IAAI,GAAGQ,WAAX,EAAwB;AACtBC,MAAAA,OAAO,GAAGV,CAAV;AACAS,MAAAA,WAAW,GAAGR,IAAd;AACD;AACF;;AAED,MAAMW,CAAC,GAAGR,MAAM,CAACM,OAAD,CAAhB;AACA,MAAMG,CAAC,GAAGR,MAAM,CAACK,OAAD,CAAhB;AAEA,MAAII,CAAC,GAAG,GAAR;AACA,MAAIC,CAAC,GAAG,GAAR;;AAEA,MAAIb,IAAI,CAACS,GAAL,CAASlC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCD,CAAjC,CAAD,CAAf,IAAwDL,SAA5D,EAAuE;AACrE,QAAMS,EAAE,GAAGvC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCA,CAAjC,CAAD,CAAjB;AACA,QAAMI,EAAE,GAAGxC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BM,CAA9B,EAAiCA,CAAjC,CAAD,CAAjB;AACA,QAAMM,EAAE,GAAGzC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCD,CAAjC,CAAD,CAAjB;AAEA,QAAMO,GAAG,GAAG,CAACH,EAAE,GAAGC,EAAN,IAAY,GAAZ,GAAkBC,EAA9B;AACA,QAAIE,CAAJ;;AAEA,QAAID,GAAG,GAAG,GAAV,EAAe;AACbC,MAAAA,CAAC,GAAG,CAAC,GAAD,IAAQ,CAACD,GAAD,GAAOjB,IAAI,CAACC,IAAL,CAAU,MAAMgB,GAAG,GAAGA,GAAtB,CAAf,CAAJ;AACD,KAFD,MAEO;AACLC,MAAAA,CAAC,GAAG,OAAOD,GAAG,GAAGjB,IAAI,CAACC,IAAL,CAAU,MAAMgB,GAAG,GAAGA,GAAtB,CAAb,CAAJ;AACD;;AAEDL,IAAAA,CAAC,GAAG,MAAMZ,IAAI,CAACC,IAAL,CAAU,MAAMiB,CAAC,GAAGA,CAApB,CAAV;AACAL,IAAAA,CAAC,GAAGK,CAAC,GAAGN,CAAR;AACD;;AAGD3C,gBAAQkD,QAAR,CAAiBC,EAAjB,CAAoB5C,MAApB;;AACAA,EAAAA,MAAM,CAACR,aAAa,CAACoC,eAAd,CAA8BM,CAA9B,EAAiCA,CAAjC,CAAD,CAAN,GAA8ClC,MAAM,CAACR,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCA,CAAjC,CAAD,CAAN,GAA8CC,CAA5F;AACApC,EAAAA,MAAM,CAACR,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCD,CAAjC,CAAD,CAAN,GAA8CG,CAA9C;AACArC,EAAAA,MAAM,CAACR,aAAa,CAACoC,eAAd,CAA8BM,CAA9B,EAAiCC,CAAjC,CAAD,CAAN,GAA8C,CAACE,CAA/C;AAEA,SAAOrC,MAAP;AACD","sourcesContent":["// This file is derived from the Cesium math library under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\nimport {Matrix3, _MathUtils} from '@math.gl/core';\n\nconst scratchMatrix = new Matrix3();\nconst scratchUnitary = new Matrix3();\nconst scratchDiagonal = new Matrix3();\n\nconst jMatrix = new Matrix3();\nconst jMatrixTranspose = new Matrix3();\n\nexport type EigenDecomposition = {\n  unitary: Matrix3;\n  diagonal: Matrix3;\n};\n\n/**\n * Computes the eigenvectors and eigenvalues of a symmetric matrix.\n *\n * - Returns a diagonal matrix and unitary matrix such that:\n * `matrix = unitary matrix * diagonal matrix * transpose(unitary matrix)`\n * - The values along the diagonal of the diagonal matrix are the eigenvalues. The columns\n * of the unitary matrix are the corresponding eigenvectors.\n * - This routine was created based upon Matrix Computations, 3rd ed., by Golub and Van Loan,\n * section 8.4.3 The Classical Jacobi Algorithm\n *\n * @param matrix The 3x3 matrix to decompose into diagonal and unitary matrix. Expected to be symmetric.\n * @param result Optional object with unitary and diagonal properties which are matrices onto which to store the result.\n * @returns An object with unitary and diagonal properties which are the unitary and diagonal matrices, respectively.\n *\n * @example\n * const a = //... symmetric matrix\n * const result = {\n *   unitary : new Matrix3(),\n *   diagonal : new Matrix3()\n * };\n * computeEigenDecomposition(a, result);\n *\n * const unitaryTranspose = Matrix3.transpose(result.unitary, new Matrix3());\n * const b = Matrix3.multiply(result.unitary, result.diagonal, new Matrix3());\n * Matrix3.multiply(b, unitaryTranspose, b); // b is now equal to a\n *\n * const lambda = result.diagonal.getColumn(0, new Vector3()).x;  // first eigenvalue\n * const v = result.unitary.getColumn(0, new Vector3());          // first eigenvector\n * const c = v.multiplyByScalar(lambda);                          // equal to v.transformByMatrix3(a)\n */\nexport default function computeEigenDecomposition(\n  matrix: number[],\n  // @ts-expect-error accept empty object type\n  result: EigenDecomposition = {}\n): EigenDecomposition {\n  const EIGEN_TOLERANCE = _MathUtils.EPSILON20;\n  const EIGEN_MAX_SWEEPS = 10;\n\n  let count = 0;\n  let sweep = 0;\n\n  const unitaryMatrix = scratchUnitary;\n  const diagonalMatrix = scratchDiagonal;\n\n  unitaryMatrix.identity();\n  diagonalMatrix.copy(matrix);\n\n  const epsilon = EIGEN_TOLERANCE * computeFrobeniusNorm(diagonalMatrix);\n\n  while (sweep < EIGEN_MAX_SWEEPS && offDiagonalFrobeniusNorm(diagonalMatrix) > epsilon) {\n    shurDecomposition(diagonalMatrix, jMatrix);\n\n    jMatrixTranspose.copy(jMatrix).transpose();\n\n    diagonalMatrix.multiplyRight(jMatrix);\n    diagonalMatrix.multiplyLeft(jMatrixTranspose);\n    unitaryMatrix.multiplyRight(jMatrix);\n\n    if (++count > 2) {\n      ++sweep;\n      count = 0;\n    }\n  }\n\n  result.unitary = unitaryMatrix.toTarget(result.unitary);\n  result.diagonal = diagonalMatrix.toTarget(result.diagonal);\n\n  return result;\n}\n\nfunction computeFrobeniusNorm(matrix: Matrix3): number {\n  let norm = 0.0;\n  for (let i = 0; i < 9; ++i) {\n    const temp = matrix[i];\n    norm += temp * temp;\n  }\n  return Math.sqrt(norm);\n}\n\nconst rowVal = [1, 0, 0];\nconst colVal = [2, 2, 1];\n\n// Computes the \"off-diagonal\" Frobenius norm.\n// Assumes matrix is symmetric.\nfunction offDiagonalFrobeniusNorm(matrix: Matrix3): number {\n  let norm = 0.0;\n  for (let i = 0; i < 3; ++i) {\n    const temp = matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])];\n    norm += 2.0 * temp * temp;\n  }\n  return Math.sqrt(norm);\n}\n\n// The routine takes a matrix, which is assumed to be symmetric, and\n// finds the largest off-diagonal term, and then creates\n// a matrix (result) which can be used to help reduce it\n//\n// This routine was created based upon Matrix Computations, 3rd ed., by Golub and Van Loan,\n// section 8.4.2 The 2by2 Symmetric Schur Decomposition.\n//\n// eslint-disable-next-line max-statements\nfunction shurDecomposition(matrix: Matrix3, result: Matrix3): Matrix3 {\n  const tolerance = _MathUtils.EPSILON15;\n\n  let maxDiagonal = 0.0;\n  let rotAxis = 1;\n\n  // find pivot (rotAxis) based on max diagonal of matrix\n  for (let i = 0; i < 3; ++i) {\n    const temp = Math.abs(matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])]);\n    if (temp > maxDiagonal) {\n      rotAxis = i;\n      maxDiagonal = temp;\n    }\n  }\n\n  const p = rowVal[rotAxis];\n  const q = colVal[rotAxis];\n\n  let c = 1.0;\n  let s = 0.0;\n\n  if (Math.abs(matrix[scratchMatrix.getElementIndex(q, p)]) > tolerance) {\n    const qq = matrix[scratchMatrix.getElementIndex(q, q)];\n    const pp = matrix[scratchMatrix.getElementIndex(p, p)];\n    const qp = matrix[scratchMatrix.getElementIndex(q, p)];\n\n    const tau = (qq - pp) / 2.0 / qp;\n    let t;\n\n    if (tau < 0.0) {\n      t = -1.0 / (-tau + Math.sqrt(1.0 + tau * tau));\n    } else {\n      t = 1.0 / (tau + Math.sqrt(1.0 + tau * tau));\n    }\n\n    c = 1.0 / Math.sqrt(1.0 + t * t);\n    s = t * c;\n  }\n\n  // Copy into result\n  Matrix3.IDENTITY.to(result);\n  result[scratchMatrix.getElementIndex(p, p)] = result[scratchMatrix.getElementIndex(q, q)] = c;\n  result[scratchMatrix.getElementIndex(q, p)] = s;\n  result[scratchMatrix.getElementIndex(p, q)] = -s;\n\n  return result;\n}\n"],"file":"compute-eigen-decomposition.js"}