@math.gl/culling 3.6.0-alpha.1 → 3.6.0-alpha.2

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

@@ -1 +1 @@
-{"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,MAAMA,cAAc,GAAG,IAAIC,aAAJ,EAAvB;AACA,MAAMC,cAAc,GAAG,IAAID,aAAJ,EAAvB;AACA,MAAME,cAAc,GAAG,IAAIF,aAAJ,EAAvB;AACA,MAAMG,cAAc,GAAG,IAAIH,aAAJ,EAAvB;AACA,MAAMI,cAAc,GAAG,IAAIJ,aAAJ,EAAvB;AACA,MAAMK,cAAc,GAAG,IAAIL,aAAJ,EAAvB;AACA,MAAMM,oBAAoB,GAAG,IAAIN,aAAJ,EAA7B;AACA,MAAMO,iBAAiB,GAAG,IAAIP,aAAJ,EAA1B;AACA,MAAMQ,sBAAsB,GAAG,IAAIR,aAAJ,EAA/B;AACA,MAAMS,kBAAkB,GAAG,IAAIT,aAAJ,EAA3B;AACA,MAAMU,kBAAkB,GAAG,IAAIV,aAAJ,EAA3B;AACA,MAAMW,4BAA4B,GAAG,IAAIX,aAAJ,EAArC;AACA,MAAMY,cAAc,GAAI,MAAM,GAAP,GAAcC,IAAI,CAACC,EAA1C;;AAae,SAASC,4BAAT,CACbC,SADa,EAEbC,MAAsB,GAAG,IAAIC,uBAAJ,EAFZ,EAGG;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,QAAMC,UAAU,GAAGf,oBAAoB,CAACgB,IAArB,CAA0BN,SAAS,CAAC,CAAD,CAAnC,CAAnB;AAEA,QAAMO,IAAI,GAAGxB,cAAc,CAACuB,IAAf,CAAoBD,UAApB,CAAb;AACA,QAAMG,IAAI,GAAGvB,cAAc,CAACqB,IAAf,CAAoBD,UAApB,CAAb;AACA,QAAMI,IAAI,GAAGvB,cAAc,CAACoB,IAAf,CAAoBD,UAApB,CAAb;AAEA,QAAMK,IAAI,GAAGvB,cAAc,CAACmB,IAAf,CAAoBD,UAApB,CAAb;AACA,QAAMM,IAAI,GAAGvB,cAAc,CAACkB,IAAf,CAAoBD,UAApB,CAAb;AACA,QAAMO,IAAI,GAAGvB,cAAc,CAACiB,IAAf,CAAoBD,UAApB,CAAb;;AAEA,OAAK,MAAMQ,QAAX,IAAuBb,SAAvB,EAAkC;AAChCK,IAAAA,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,QAAIF,CAAC,GAAGP,IAAI,CAACO,CAAb,EAAgB;AACdP,MAAAA,IAAI,CAACD,IAAL,CAAUD,UAAV;AACD;;AAED,QAAIS,CAAC,GAAGJ,IAAI,CAACI,CAAb,EAAgB;AACdJ,MAAAA,IAAI,CAACJ,IAAL,CAAUD,UAAV;AACD;;AAED,QAAIU,CAAC,GAAGP,IAAI,CAACO,CAAb,EAAgB;AACdP,MAAAA,IAAI,CAACF,IAAL,CAAUD,UAAV;AACD;;AAED,QAAIU,CAAC,GAAGJ,IAAI,CAACI,CAAb,EAAgB;AACdJ,MAAAA,IAAI,CAACL,IAAL,CAAUD,UAAV;AACD;;AAED,QAAIW,CAAC,GAAGP,IAAI,CAACO,CAAb,EAAgB;AACdP,MAAAA,IAAI,CAACH,IAAL,CAAUD,UAAV;AACD;;AAED,QAAIW,CAAC,GAAGJ,IAAI,CAACI,CAAb,EAAgB;AACdJ,MAAAA,IAAI,CAACN,IAAL,CAAUD,UAAV;AACD;AACF;;AAGD,QAAMY,KAAK,GAAG1B,iBAAiB,CAACe,IAAlB,CAAuBI,IAAvB,EAA6BQ,QAA7B,CAAsCX,IAAtC,EAA4CY,gBAA5C,EAAd;AACA,QAAMC,KAAK,GAAG7B,iBAAiB,CAACe,IAAlB,CAAuBK,IAAvB,EAA6BO,QAA7B,CAAsCV,IAAtC,EAA4CW,gBAA5C,EAAd;AACA,QAAME,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,QAAMa,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,QAAMG,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,QAAMc,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,QAAMe,WAAW,GAAGpC,4BAA4B,CAC7CW,IADiB,CACZuB,QADY,EAEjBG,GAFiB,CAEbF,QAFa,EAGjBG,gBAHiB,CAGA,GAHA,CAApB;AAMA,MAAIC,WAAW,GAAG,CAAlB;;AACA,OAAK,MAAMrB,QAAX,IAAuBb,SAAvB,EAAkC;AAChCK,IAAAA,UAAU,CAACC,IAAX,CAAgBO,QAAhB;AAGA,UAAMsB,CAAC,GAAG5C,iBAAiB,CAACe,IAAlB,CAAuBD,UAAvB,EAAmCa,QAAnC,CAA4Ca,WAA5C,EAAyDK,SAAzD,EAAV;;AACA,QAAID,CAAC,GAAGD,WAAR,EAAqB;AACnBA,MAAAA,WAAW,GAAGC,CAAd;AACD;;AAGD,UAAME,uBAAuB,GAAG9C,iBAAiB,CAC9Ce,IAD6B,CACxBD,UADwB,EAE7Ba,QAF6B,CAEpBO,YAFoB,EAG7BN,gBAH6B,EAAhC;;AAKA,QAAIkB,uBAAuB,GAAGX,aAA9B,EAA6C;AAC3C,YAAMY,gBAAgB,GAAGzC,IAAI,CAAC+B,IAAL,CAAUS,uBAAV,CAAzB;AAEAV,MAAAA,YAAY,GAAG,CAACA,YAAY,GAAGW,gBAAhB,IAAoC,GAAnD;AACAZ,MAAAA,aAAa,GAAGC,YAAY,GAAGA,YAA/B;AAEA,YAAMY,QAAQ,GAAGD,gBAAgB,GAAGX,YAApC;AACAF,MAAAA,YAAY,CAACX,CAAb,GAAiB,CAACa,YAAY,GAAGF,YAAY,CAACX,CAA5B,GAAgCyB,QAAQ,GAAGlC,UAAU,CAACS,CAAvD,IAA4DwB,gBAA7E;AACAb,MAAAA,YAAY,CAACV,CAAb,GAAiB,CAACY,YAAY,GAAGF,YAAY,CAACV,CAA5B,GAAgCwB,QAAQ,GAAGlC,UAAU,CAACU,CAAvD,IAA4DuB,gBAA7E;AACAb,MAAAA,YAAY,CAACT,CAAb,GAAiB,CAACW,YAAY,GAAGF,YAAY,CAACT,CAA5B,GAAgCuB,QAAQ,GAAGlC,UAAU,CAACW,CAAvD,IAA4DsB,gBAA7E;AACD;AACF;;AAED,MAAIX,YAAY,GAAGO,WAAnB,EAAgC;AAC9BT,IAAAA,YAAY,CAACe,EAAb,CAAgBvC,MAAM,CAACwC,MAAvB;AAEAxC,IAAAA,MAAM,CAACyC,MAAP,GAAgBf,YAAhB;AACD,GAJD,MAIO;AACLI,IAAAA,WAAW,CAACS,EAAZ,CAAevC,MAAM,CAACwC,MAAtB;AAEAxC,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    // @ts-ignore TS2540: Cannot assign to 'radius' because it is a read-only property.\n    result.radius = ritterRadius;\n  } else {\n    naiveCenter.to(result.center);\n    // @ts-ignore TS2540: Cannot assign to 'radius' because it is a read-only property.\n    result.radius = naiveRadius;\n  }\n\n  return result;\n}\n"],"file":"bounding-sphere-from-points.js"}
+{"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

@@ -7,22 +7,23 @@ exports.default = computeEigenDecomposition;
 
 var _core = require("@math.gl/core");
 
-const scratchMatrix = new _core.Matrix3();
-const scratchUnitary = new _core.Matrix3();
-const scratchDiagonal = new _core.Matrix3();
-const jMatrix = new _core.Matrix3();
-const jMatrixTranspose = new _core.Matrix3();
-
-function computeEigenDecomposition(matrix, result = {}) {
-  const EIGEN_TOLERANCE = _core._MathUtils.EPSILON20;
-  const EIGEN_MAX_SWEEPS = 10;
-  let count = 0;
-  let sweep = 0;
-  const unitaryMatrix = scratchUnitary;
-  const diagonalMatrix = scratchDiagonal;
+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);
-  const epsilon = EIGEN_TOLERANCE * computeFrobeniusNorm(diagonalMatrix);
+  var epsilon = EIGEN_TOLERANCE * computeFrobeniusNorm(diagonalMatrix);
 
   while (sweep < EIGEN_MAX_SWEEPS && offDiagonalFrobeniusNorm(diagonalMatrix) > epsilon) {
     shurDecomposition(diagonalMatrix, jMatrix);
@@ -43,24 +44,24 @@ function computeEigenDecomposition(matrix, result = {}) {
 }
 
 function computeFrobeniusNorm(matrix) {
-  let norm = 0.0;
+  var norm = 0.0;
 
-  for (let i = 0; i < 9; ++i) {
-    const temp = matrix[i];
+  for (var i = 0; i < 9; ++i) {
+    var temp = matrix[i];
     norm += temp * temp;
   }
 
   return Math.sqrt(norm);
 }
 
-const rowVal = [1, 0, 0];
-const colVal = [2, 2, 1];
+var rowVal = [1, 0, 0];
+var colVal = [2, 2, 1];
 
 function offDiagonalFrobeniusNorm(matrix) {
-  let norm = 0.0;
+  var norm = 0.0;
 
-  for (let i = 0; i < 3; ++i) {
-    const temp = matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])];
+  for (var i = 0; i < 3; ++i) {
+    var temp = matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])];
     norm += 2.0 * temp * temp;
   }
 
@@ -68,12 +69,12 @@ function offDiagonalFrobeniusNorm(matrix) {
 }
 
 function shurDecomposition(matrix, result) {
-  const tolerance = _core._MathUtils.EPSILON15;
-  let maxDiagonal = 0.0;
-  let rotAxis = 1;
+  var tolerance = _core._MathUtils.EPSILON15;
+  var maxDiagonal = 0.0;
+  var rotAxis = 1;
 
-  for (let i = 0; i < 3; ++i) {
-    const temp = Math.abs(matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])]);
+  for (var i = 0; i < 3; ++i) {
+    var temp = Math.abs(matrix[scratchMatrix.getElementIndex(colVal[i], rowVal[i])]);
 
     if (temp > maxDiagonal) {
       rotAxis = i;
@@ -81,17 +82,17 @@ function shurDecomposition(matrix, result) {
     }
   }
 
-  const p = rowVal[rotAxis];
-  const q = colVal[rotAxis];
-  let c = 1.0;
-  let s = 0.0;
+  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) {
-    const qq = matrix[scratchMatrix.getElementIndex(q, q)];
-    const pp = matrix[scratchMatrix.getElementIndex(p, p)];
-    const qp = matrix[scratchMatrix.getElementIndex(q, p)];
-    const tau = (qq - pp) / 2.0 / qp;
-    let t;
+    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));

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

@@ -1 +1 @@
-{"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,MAAMA,aAAa,GAAG,IAAIC,aAAJ,EAAtB;AACA,MAAMC,cAAc,GAAG,IAAID,aAAJ,EAAvB;AACA,MAAME,eAAe,GAAG,IAAIF,aAAJ,EAAxB;AAEA,MAAMG,OAAO,GAAG,IAAIH,aAAJ,EAAhB;AACA,MAAMI,gBAAgB,GAAG,IAAIJ,aAAJ,EAAzB;;AAqCe,SAASK,yBAAT,CACbC,MADa,EAGbC,MAA0B,GAAG,EAHhB,EAIO;AACpB,QAAMC,eAAe,GAAGC,iBAAWC,SAAnC;AACA,QAAMC,gBAAgB,GAAG,EAAzB;AAEA,MAAIC,KAAK,GAAG,CAAZ;AACA,MAAIC,KAAK,GAAG,CAAZ;AAEA,QAAMC,aAAa,GAAGb,cAAtB;AACA,QAAMc,cAAc,GAAGb,eAAvB;AAEAY,EAAAA,aAAa,CAACE,QAAd;AACAD,EAAAA,cAAc,CAACE,IAAf,CAAoBX,MAApB;AAEA,QAAMY,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,EAAsC;AACpC,MAAIsB,IAAI,GAAG,GAAX;;AACA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuB,EAAEA,CAAzB,EAA4B;AAC1B,UAAMC,IAAI,GAAGxB,MAAM,CAACuB,CAAD,CAAnB;AACAD,IAAAA,IAAI,IAAIE,IAAI,GAAGA,IAAf;AACD;;AACD,SAAOC,IAAI,CAACC,IAAL,CAAUJ,IAAV,CAAP;AACD;;AAED,MAAMK,MAAM,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAAf;AACA,MAAMC,MAAM,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAAf;;AAIA,SAASd,wBAAT,CAAkCd,MAAlC,EAA0C;AACxC,MAAIsB,IAAI,GAAG,GAAX;;AACA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuB,EAAEA,CAAzB,EAA4B;AAC1B,UAAMC,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,EAAmCC,MAAnC,EAA2C;AACzC,QAAM6B,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,UAAMC,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,QAAMW,CAAC,GAAGR,MAAM,CAACM,OAAD,CAAhB;AACA,QAAMG,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,UAAMS,EAAE,GAAGvC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCA,CAAjC,CAAD,CAAjB;AACA,UAAMI,EAAE,GAAGxC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BM,CAA9B,EAAiCA,CAAjC,CAAD,CAAjB;AACA,UAAMM,EAAE,GAAGzC,MAAM,CAACP,aAAa,CAACoC,eAAd,CAA8BO,CAA9B,EAAiCD,CAAjC,CAAD,CAAjB;AAEA,UAAMO,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) {\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) {\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, result) {\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"}
+{"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,EAAsC;AACpC,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,EAA0C;AACxC,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,EAAmCC,MAAnC,EAA2C;AACzC,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) {\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) {\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, result) {\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"}

package/dist/es5/lib/bounding-volumes/axis-aligned-bounding-box.js

@@ -7,17 +7,25 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.default = void 0;
 
+var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
+
+var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
+
 var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
 
 var _core = require("@math.gl/core");
 
 var _constants = require("../../constants");
 
-const scratchVector = new _core.Vector3();
-const scratchNormal = new _core.Vector3();
+var scratchVector = new _core.Vector3();
+var scratchNormal = new _core.Vector3();
 
-class AxisAlignedBoundingBox {
-  constructor(minimum = [0, 0, 0], maximum = [0, 0, 0], center) {
+var AxisAlignedBoundingBox = function () {
+  function AxisAlignedBoundingBox() {
+    var minimum = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [0, 0, 0];
+    var maximum = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [0, 0, 0];
+    var center = arguments.length > 2 ? arguments[2] : undefined;
+    (0, _classCallCheck2.default)(this, AxisAlignedBoundingBox);
     (0, _defineProperty2.default)(this, "center", void 0);
     (0, _defineProperty2.default)(this, "halfDiagonal", void 0);
     (0, _defineProperty2.default)(this, "minimum", void 0);
@@ -29,74 +37,78 @@ class AxisAlignedBoundingBox {
     this.maximum = new _core.Vector3(maximum);
   }
 
-  clone() {
-    return new AxisAlignedBoundingBox(this.minimum, this.maximum, this.center);
-  }
-
-  equals(right) {
-    return this === right || Boolean(right) && this.minimum.equals(right.minimum) && this.maximum.equals(right.maximum);
-  }
-
-  transform(transform) {
-    this.center.transformAsPoint(transform);
-    this.halfDiagonal.transform(transform);
-    this.minimum.transform(transform);
-    this.maximum.transform(transform);
-    return this;
-  }
-
-  intersectPlane(plane) {
-    const {
-      halfDiagonal
-    } = this;
-    const normal = scratchNormal.from(plane.normal);
-    const e = halfDiagonal.x * Math.abs(normal.x) + halfDiagonal.y * Math.abs(normal.y) + halfDiagonal.z * Math.abs(normal.z);
-    const s = this.center.dot(normal) + plane.distance;
-
-    if (s - e > 0) {
-      return _constants.INTERSECTION.INSIDE;
+  (0, _createClass2.default)(AxisAlignedBoundingBox, [{
+    key: "clone",
+    value: function clone() {
+      return new AxisAlignedBoundingBox(this.minimum, this.maximum, this.center);
     }
-
-    if (s + e < 0) {
-      return _constants.INTERSECTION.OUTSIDE;
+  }, {
+    key: "equals",
+    value: function equals(right) {
+      return this === right || Boolean(right) && this.minimum.equals(right.minimum) && this.maximum.equals(right.maximum);
     }
-
-    return _constants.INTERSECTION.INTERSECTING;
-  }
-
-  distanceTo(point) {
-    return Math.sqrt(this.distanceSquaredTo(point));
-  }
-
-  distanceSquaredTo(point) {
-    const offset = scratchVector.from(point).subtract(this.center);
-    const {
-      halfDiagonal
-    } = this;
-    let distanceSquared = 0.0;
-    let d;
-    d = Math.abs(offset.x) - halfDiagonal.x;
-
-    if (d > 0) {
-      distanceSquared += d * d;
+  }, {
+    key: "transform",
+    value: function transform(_transform) {
+      this.center.transformAsPoint(_transform);
+      this.halfDiagonal.transform(_transform);
+      this.minimum.transform(_transform);
+      this.maximum.transform(_transform);
+      return this;
+    }
+  }, {
+    key: "intersectPlane",
+    value: function intersectPlane(plane) {
+      var halfDiagonal = this.halfDiagonal;
+      var normal = scratchNormal.from(plane.normal);
+      var e = halfDiagonal.x * Math.abs(normal.x) + halfDiagonal.y * Math.abs(normal.y) + halfDiagonal.z * Math.abs(normal.z);
+      var s = this.center.dot(normal) + plane.distance;
+
+      if (s - e > 0) {
+        return _constants.INTERSECTION.INSIDE;
+      }
+
+      if (s + e < 0) {
+        return _constants.INTERSECTION.OUTSIDE;
+      }
+
+      return _constants.INTERSECTION.INTERSECTING;
     }
+  }, {
+    key: "distanceTo",
+    value: function distanceTo(point) {
+      return Math.sqrt(this.distanceSquaredTo(point));
+    }
+  }, {
+    key: "distanceSquaredTo",
+    value: function distanceSquaredTo(point) {
+      var offset = scratchVector.from(point).subtract(this.center);
+      var halfDiagonal = this.halfDiagonal;
+      var distanceSquared = 0.0;
+      var d;
+      d = Math.abs(offset.x) - halfDiagonal.x;
 
-    d = Math.abs(offset.y) - halfDiagonal.y;
+      if (d > 0) {
+        distanceSquared += d * d;
+      }
 
-    if (d > 0) {
-      distanceSquared += d * d;
-    }
+      d = Math.abs(offset.y) - halfDiagonal.y;
 
-    d = Math.abs(offset.z) - halfDiagonal.z;
+      if (d > 0) {
+        distanceSquared += d * d;
+      }
 
-    if (d > 0) {
-      distanceSquared += d * d;
-    }
+      d = Math.abs(offset.z) - halfDiagonal.z;
 
-    return distanceSquared;
-  }
+      if (d > 0) {
+        distanceSquared += d * d;
+      }
 
-}
+      return distanceSquared;
+    }
+  }]);
+  return AxisAlignedBoundingBox;
+}();
 
 exports.default = AxisAlignedBoundingBox;
 //# sourceMappingURL=axis-aligned-bounding-box.js.map

package/dist/es5/lib/bounding-volumes/axis-aligned-bounding-box.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../src/lib/bounding-volumes/axis-aligned-bounding-box.ts"],"names":["scratchVector","Vector3","scratchNormal","AxisAlignedBoundingBox","constructor","minimum","maximum","center","copy","add","scale","halfDiagonal","subtract","clone","equals","right","Boolean","transform","transformAsPoint","intersectPlane","plane","normal","from","e","x","Math","abs","y","z","s","dot","distance","INTERSECTION","INSIDE","OUTSIDE","INTERSECTING","distanceTo","point","sqrt","distanceSquaredTo","offset","distanceSquared","d"],"mappings":";;;;;;;;;;;AACA;;AAEA;;AAEA,MAAMA,aAAa,GAAG,IAAIC,aAAJ,EAAtB;AACA,MAAMC,aAAa,GAAG,IAAID,aAAJ,EAAtB;;AAQe,MAAME,sBAAN,CAAuD;AAgBpEC,EAAAA,WAAW,CACTC,OAA0B,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CADpB,EAETC,OAA0B,GAAG,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAFpB,EAGTC,MAHS,EAIT;AAAA;AAAA;AAAA;AAAA;AAEAA,IAAAA,MAAM,GAAGA,MAAM,IAAIP,aAAa,CAACQ,IAAd,CAAmBH,OAAnB,EAA4BI,GAA5B,CAAgCH,OAAhC,EAAyCI,KAAzC,CAA+C,GAA/C,CAAnB;AACA,SAAKH,MAAL,GAAc,IAAIN,aAAJ,CAAYM,MAAZ,CAAd;AACA,SAAKI,YAAL,GAAoB,IAAIV,aAAJ,CAAYK,OAAZ,EAAqBM,QAArB,CAA8B,KAAKL,MAAnC,CAApB;AAOA,SAAKF,OAAL,GAAe,IAAIJ,aAAJ,CAAYI,OAAZ,CAAf;AAOA,SAAKC,OAAL,GAAe,IAAIL,aAAJ,CAAYK,OAAZ,CAAf;AACD;;AAODO,EAAAA,KAAK,GAAG;AACN,WAAO,IAAIV,sBAAJ,CAA2B,KAAKE,OAAhC,EAAyC,KAAKC,OAA9C,EAAuD,KAAKC,MAA5D,CAAP;AACD;;AASDO,EAAAA,MAAM,CAACC,KAAD,EAAQ;AACZ,WACE,SAASA,KAAT,IACCC,OAAO,CAACD,KAAD,CAAP,IAAkB,KAAKV,OAAL,CAAaS,MAAb,CAAoBC,KAAK,CAACV,OAA1B,CAAlB,IAAwD,KAAKC,OAAL,CAAaQ,MAAb,CAAoBC,KAAK,CAACT,OAA1B,CAF3D;AAID;;AAODW,EAAAA,SAAS,CAACA,SAAD,EAAqC;AAC5C,SAAKV,MAAL,CAAYW,gBAAZ,CAA6BD,SAA7B;AAEA,SAAKN,YAAL,CAAkBM,SAAlB,CAA4BA,SAA5B;AACA,SAAKZ,OAAL,CAAaY,SAAb,CAAuBA,SAAvB;AACA,SAAKX,OAAL,CAAaW,SAAb,CAAuBA,SAAvB;AACA,WAAO,IAAP;AACD;;AAKDE,EAAAA,cAAc,CAACC,KAAD,EAA6B;AACzC,UAAM;AAACT,MAAAA;AAAD,QAAiB,IAAvB;AACA,UAAMU,MAAM,GAAGnB,aAAa,CAACoB,IAAd,CAAmBF,KAAK,CAACC,MAAzB,CAAf;AACA,UAAME,CAAC,GACLZ,YAAY,CAACa,CAAb,GAAiBC,IAAI,CAACC,GAAL,CAASL,MAAM,CAACG,CAAhB,CAAjB,GACAb,YAAY,CAACgB,CAAb,GAAiBF,IAAI,CAACC,GAAL,CAASL,MAAM,CAACM,CAAhB,CADjB,GAEAhB,YAAY,CAACiB,CAAb,GAAiBH,IAAI,CAACC,GAAL,CAASL,MAAM,CAACO,CAAhB,CAHnB;AAIA,UAAMC,CAAC,GAAG,KAAKtB,MAAL,CAAYuB,GAAZ,CAAgBT,MAAhB,IAA0BD,KAAK,CAACW,QAA1C;;AAEA,QAAIF,CAAC,GAAGN,CAAJ,GAAQ,CAAZ,EAAe;AACb,aAAOS,wBAAaC,MAApB;AACD;;AAED,QAAIJ,CAAC,GAAGN,CAAJ,GAAQ,CAAZ,EAAe;AAEb,aAAOS,wBAAaE,OAApB;AACD;;AAED,WAAOF,wBAAaG,YAApB;AACD;;AAGDC,EAAAA,UAAU,CAACC,KAAD,EAAmC;AAC3C,WAAOZ,IAAI,CAACa,IAAL,CAAU,KAAKC,iBAAL,CAAuBF,KAAvB,CAAV,CAAP;AACD;;AAGDE,EAAAA,iBAAiB,CAACF,KAAD,EAAmC;AAClD,UAAMG,MAAM,GAAGxC,aAAa,CAACsB,IAAd,CAAmBe,KAAnB,EAA0BzB,QAA1B,CAAmC,KAAKL,MAAxC,CAAf;AACA,UAAM;AAACI,MAAAA;AAAD,QAAiB,IAAvB;AAEA,QAAI8B,eAAe,GAAG,GAAtB;AACA,QAAIC,CAAJ;AAEAA,IAAAA,CAAC,GAAGjB,IAAI,CAACC,GAAL,CAASc,MAAM,CAAChB,CAAhB,IAAqBb,YAAY,CAACa,CAAtC;;AACA,QAAIkB,CAAC,GAAG,CAAR,EAAW;AACTD,MAAAA,eAAe,IAAIC,CAAC,GAAGA,CAAvB;AACD;;AAEDA,IAAAA,CAAC,GAAGjB,IAAI,CAACC,GAAL,CAASc,MAAM,CAACb,CAAhB,IAAqBhB,YAAY,CAACgB,CAAtC;;AACA,QAAIe,CAAC,GAAG,CAAR,EAAW;AACTD,MAAAA,eAAe,IAAIC,CAAC,GAAGA,CAAvB;AACD;;AAEDA,IAAAA,CAAC,GAAGjB,IAAI,CAACC,GAAL,CAASc,MAAM,CAACZ,CAAhB,IAAqBjB,YAAY,CAACiB,CAAtC;;AACA,QAAIc,CAAC,GAAG,CAAR,EAAW;AACTD,MAAAA,eAAe,IAAIC,CAAC,GAAGA,CAAvB;AACD;;AAED,WAAOD,eAAP;AACD;;AAnImE","sourcesContent":["import {BoundingVolume} from './bounding-volume';\nimport {Vector3} from '@math.gl/core';\nimport Plane from '../plane';\nimport {INTERSECTION} from '../../constants';\n\nconst scratchVector = new Vector3();\nconst scratchNormal = new Vector3();\n\n/**\n * An axis aligned bounding box - aligned with coordinate axes\n * @see BoundingVolume\n * @see BoundingRectangle\n * @see OrientedBoundingBox\n */\nexport default class AxisAlignedBoundingBox implements BoundingVolume {\n  /** The center point of the bounding box. */\n  readonly center: Vector3;\n  /** The positive half diagonal of the bounding box. */\n  readonly halfDiagonal: Vector3;\n  /** The minimum point defining the bounding box. [0, 0, 0] for empty box */\n  readonly minimum: Vector3;\n  /** The maximum point defining the bounding box. [0, 0, 0] for empty box */\n  readonly maximum: Vector3;\n\n  /**\n   * Creates an instance of an AxisAlignedBoundingBox from the minimum and maximum points along the x, y, and z axes.\n   * @param minimum=[0, 0, 0] The minimum point along the x, y, and z axes.\n   * @param maximum=[0, 0, 0] The maximum point along the x, y, and z axes.\n   * @param center The center of the box; automatically computed if not supplied.\n   */\n  constructor(\n    minimum: readonly number[] = [0, 0, 0],\n    maximum: readonly number[] = [0, 0, 0],\n    center?: readonly number[]\n  ) {\n    // If center was not defined, compute it.\n    center = center || scratchVector.copy(minimum).add(maximum).scale(0.5);\n    this.center = new Vector3(center);\n    this.halfDiagonal = new Vector3(maximum).subtract(this.center);\n\n    /**\n     * The minimum point defining the bounding box.\n     * @type {Vector3}\n     * @default {@link 0, 0, 0}\n     */\n    this.minimum = new Vector3(minimum);\n\n    /**\n     * The maximum point defining the bounding box.\n     * @type {Vector3}\n     * @default {@link 0, 0, 0}\n     */\n    this.maximum = new Vector3(maximum);\n  }\n\n  /**\n   * Duplicates a AxisAlignedBoundingBox instance.\n   *\n   * @returns {AxisAlignedBoundingBox} A new AxisAlignedBoundingBox instance.\n   */\n  clone() {\n    return new AxisAlignedBoundingBox(this.minimum, this.maximum, this.center);\n  }\n\n  /**\n   * Compares the provided AxisAlignedBoundingBox componentwise and returns\n   * <code>true</code> if they are equal, <code>false</code> otherwise.\n   *\n   * @param {AxisAlignedBoundingBox} [right] The second AxisAlignedBoundingBox to compare with.\n   * @returns {Boolean} <code>true</code> if left and right are equal, <code>false</code> otherwise.\n   */\n  equals(right) {\n    return (\n      this === right ||\n      (Boolean(right) && this.minimum.equals(right.minimum) && this.maximum.equals(right.maximum))\n    );\n  }\n\n  /**\n   * Applies a 4x4 affine transformation matrix to a bounding sphere.\n   * @param transform The transformation matrix to apply to the bounding sphere.\n   * @returns itself, i.e. the modified BoundingVolume.\n   */\n  transform(transform: readonly number[]): this {\n    this.center.transformAsPoint(transform);\n    // TODO - this.halfDiagonal.transformAsVector(transform);\n    this.halfDiagonal.transform(transform);\n    this.minimum.transform(transform);\n    this.maximum.transform(transform);\n    return this;\n  }\n\n  /**\n   * Determines which side of a plane a box is located.\n   */\n  intersectPlane(plane: Plane): INTERSECTION {\n    const {halfDiagonal} = this;\n    const normal = scratchNormal.from(plane.normal);\n    const e =\n      halfDiagonal.x * Math.abs(normal.x) +\n      halfDiagonal.y * Math.abs(normal.y) +\n      halfDiagonal.z * Math.abs(normal.z);\n    const s = this.center.dot(normal) + plane.distance; // signed distance from center\n\n    if (s - e > 0) {\n      return INTERSECTION.INSIDE;\n    }\n\n    if (s + e < 0) {\n      // Not in front because normals point inward\n      return INTERSECTION.OUTSIDE;\n    }\n\n    return INTERSECTION.INTERSECTING;\n  }\n\n  /** Computes the estimated distance from the closest point on a bounding box to a point. */\n  distanceTo(point: readonly number[]): number {\n    return Math.sqrt(this.distanceSquaredTo(point));\n  }\n\n  /** Computes the estimated distance squared from the closest point on a bounding box to a point. */\n  distanceSquaredTo(point: readonly number[]): number {\n    const offset = scratchVector.from(point).subtract(this.center);\n    const {halfDiagonal} = this;\n\n    let distanceSquared = 0.0;\n    let d;\n\n    d = Math.abs(offset.x) - halfDiagonal.x;\n    if (d > 0) {\n      distanceSquared += d * d;\n    }\n\n    d = Math.abs(offset.y) - halfDiagonal.y;\n    if (d > 0) {\n      distanceSquared += d * d;\n    }\n\n    d = Math.abs(offset.z) - halfDiagonal.z;\n    if (d > 0) {\n      distanceSquared += d * d;\n    }\n\n    return distanceSquared;\n  }\n}\n"],"file":"axis-aligned-bounding-box.js"}
+{"version":3,"sources":["../../../../src/lib/bounding-volumes/axis-aligned-bounding-box.ts"],"names":["scratchVector","Vector3","scratchNormal","AxisAlignedBoundingBox","minimum","maximum","center","copy","add","scale","halfDiagonal","subtract","right","Boolean","equals","transform","transformAsPoint","plane","normal","from","e","x","Math","abs","y","z","s","dot","distance","INTERSECTION","INSIDE","OUTSIDE","INTERSECTING","point","sqrt","distanceSquaredTo","offset","distanceSquared","d"],"mappings":";;;;;;;;;;;;;;;AACA;;AAEA;;AAEA,IAAMA,aAAa,GAAG,IAAIC,aAAJ,EAAtB;AACA,IAAMC,aAAa,GAAG,IAAID,aAAJ,EAAtB;;IAQqBE,sB;AAgBnB,oCAIE;AAAA,QAHAC,OAGA,uEAH6B,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAG7B;AAAA,QAFAC,OAEA,uEAF6B,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,CAE7B;AAAA,QADAC,MACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAEAA,IAAAA,MAAM,GAAGA,MAAM,IAAIN,aAAa,CAACO,IAAd,CAAmBH,OAAnB,EAA4BI,GAA5B,CAAgCH,OAAhC,EAAyCI,KAAzC,CAA+C,GAA/C,CAAnB;AACA,SAAKH,MAAL,GAAc,IAAIL,aAAJ,CAAYK,MAAZ,CAAd;AACA,SAAKI,YAAL,GAAoB,IAAIT,aAAJ,CAAYI,OAAZ,EAAqBM,QAArB,CAA8B,KAAKL,MAAnC,CAApB;AAOA,SAAKF,OAAL,GAAe,IAAIH,aAAJ,CAAYG,OAAZ,CAAf;AAOA,SAAKC,OAAL,GAAe,IAAIJ,aAAJ,CAAYI,OAAZ,CAAf;AACD;;;;WAOD,iBAAQ;AACN,aAAO,IAAIF,sBAAJ,CAA2B,KAAKC,OAAhC,EAAyC,KAAKC,OAA9C,EAAuD,KAAKC,MAA5D,CAAP;AACD;;;WASD,gBAAOM,KAAP,EAAc;AACZ,aACE,SAASA,KAAT,IACCC,OAAO,CAACD,KAAD,CAAP,IAAkB,KAAKR,OAAL,CAAaU,MAAb,CAAoBF,KAAK,CAACR,OAA1B,CAAlB,IAAwD,KAAKC,OAAL,CAAaS,MAAb,CAAoBF,KAAK,CAACP,OAA1B,CAF3D;AAID;;;WAOD,mBAAUU,UAAV,EAA8C;AAC5C,WAAKT,MAAL,CAAYU,gBAAZ,CAA6BD,UAA7B;AAEA,WAAKL,YAAL,CAAkBK,SAAlB,CAA4BA,UAA5B;AACA,WAAKX,OAAL,CAAaW,SAAb,CAAuBA,UAAvB;AACA,WAAKV,OAAL,CAAaU,SAAb,CAAuBA,UAAvB;AACA,aAAO,IAAP;AACD;;;WAKD,wBAAeE,KAAf,EAA2C;AACzC,UAAOP,YAAP,GAAuB,IAAvB,CAAOA,YAAP;AACA,UAAMQ,MAAM,GAAGhB,aAAa,CAACiB,IAAd,CAAmBF,KAAK,CAACC,MAAzB,CAAf;AACA,UAAME,CAAC,GACLV,YAAY,CAACW,CAAb,GAAiBC,IAAI,CAACC,GAAL,CAASL,MAAM,CAACG,CAAhB,CAAjB,GACAX,YAAY,CAACc,CAAb,GAAiBF,IAAI,CAACC,GAAL,CAASL,MAAM,CAACM,CAAhB,CADjB,GAEAd,YAAY,CAACe,CAAb,GAAiBH,IAAI,CAACC,GAAL,CAASL,MAAM,CAACO,CAAhB,CAHnB;AAIA,UAAMC,CAAC,GAAG,KAAKpB,MAAL,CAAYqB,GAAZ,CAAgBT,MAAhB,IAA0BD,KAAK,CAACW,QAA1C;;AAEA,UAAIF,CAAC,GAAGN,CAAJ,GAAQ,CAAZ,EAAe;AACb,eAAOS,wBAAaC,MAApB;AACD;;AAED,UAAIJ,CAAC,GAAGN,CAAJ,GAAQ,CAAZ,EAAe;AAEb,eAAOS,wBAAaE,OAApB;AACD;;AAED,aAAOF,wBAAaG,YAApB;AACD;;;WAGD,oBAAWC,KAAX,EAA6C;AAC3C,aAAOX,IAAI,CAACY,IAAL,CAAU,KAAKC,iBAAL,CAAuBF,KAAvB,CAAV,CAAP;AACD;;;WAGD,2BAAkBA,KAAlB,EAAoD;AAClD,UAAMG,MAAM,GAAGpC,aAAa,CAACmB,IAAd,CAAmBc,KAAnB,EAA0BtB,QAA1B,CAAmC,KAAKL,MAAxC,CAAf;AACA,UAAOI,YAAP,GAAuB,IAAvB,CAAOA,YAAP;AAEA,UAAI2B,eAAe,GAAG,GAAtB;AACA,UAAIC,CAAJ;AAEAA,MAAAA,CAAC,GAAGhB,IAAI,CAACC,GAAL,CAASa,MAAM,CAACf,CAAhB,IAAqBX,YAAY,CAACW,CAAtC;;AACA,UAAIiB,CAAC,GAAG,CAAR,EAAW;AACTD,QAAAA,eAAe,IAAIC,CAAC,GAAGA,CAAvB;AACD;;AAEDA,MAAAA,CAAC,GAAGhB,IAAI,CAACC,GAAL,CAASa,MAAM,CAACZ,CAAhB,IAAqBd,YAAY,CAACc,CAAtC;;AACA,UAAIc,CAAC,GAAG,CAAR,EAAW;AACTD,QAAAA,eAAe,IAAIC,CAAC,GAAGA,CAAvB;AACD;;AAEDA,MAAAA,CAAC,GAAGhB,IAAI,CAACC,GAAL,CAASa,MAAM,CAACX,CAAhB,IAAqBf,YAAY,CAACe,CAAtC;;AACA,UAAIa,CAAC,GAAG,CAAR,EAAW;AACTD,QAAAA,eAAe,IAAIC,CAAC,GAAGA,CAAvB;AACD;;AAED,aAAOD,eAAP;AACD","sourcesContent":["import {BoundingVolume} from './bounding-volume';\nimport {Vector3} from '@math.gl/core';\nimport Plane from '../plane';\nimport {INTERSECTION} from '../../constants';\n\nconst scratchVector = new Vector3();\nconst scratchNormal = new Vector3();\n\n/**\n * An axis aligned bounding box - aligned with coordinate axes\n * @see BoundingVolume\n * @see BoundingRectangle\n * @see OrientedBoundingBox\n */\nexport default class AxisAlignedBoundingBox implements BoundingVolume {\n  /** The center point of the bounding box. */\n  readonly center: Vector3;\n  /** The positive half diagonal of the bounding box. */\n  readonly halfDiagonal: Vector3;\n  /** The minimum point defining the bounding box. [0, 0, 0] for empty box */\n  readonly minimum: Vector3;\n  /** The maximum point defining the bounding box. [0, 0, 0] for empty box */\n  readonly maximum: Vector3;\n\n  /**\n   * Creates an instance of an AxisAlignedBoundingBox from the minimum and maximum points along the x, y, and z axes.\n   * @param minimum=[0, 0, 0] The minimum point along the x, y, and z axes.\n   * @param maximum=[0, 0, 0] The maximum point along the x, y, and z axes.\n   * @param center The center of the box; automatically computed if not supplied.\n   */\n  constructor(\n    minimum: readonly number[] = [0, 0, 0],\n    maximum: readonly number[] = [0, 0, 0],\n    center?: readonly number[]\n  ) {\n    // If center was not defined, compute it.\n    center = center || scratchVector.copy(minimum).add(maximum).scale(0.5);\n    this.center = new Vector3(center);\n    this.halfDiagonal = new Vector3(maximum).subtract(this.center);\n\n    /**\n     * The minimum point defining the bounding box.\n     * @type {Vector3}\n     * @default {@link 0, 0, 0}\n     */\n    this.minimum = new Vector3(minimum);\n\n    /**\n     * The maximum point defining the bounding box.\n     * @type {Vector3}\n     * @default {@link 0, 0, 0}\n     */\n    this.maximum = new Vector3(maximum);\n  }\n\n  /**\n   * Duplicates a AxisAlignedBoundingBox instance.\n   *\n   * @returns {AxisAlignedBoundingBox} A new AxisAlignedBoundingBox instance.\n   */\n  clone() {\n    return new AxisAlignedBoundingBox(this.minimum, this.maximum, this.center);\n  }\n\n  /**\n   * Compares the provided AxisAlignedBoundingBox componentwise and returns\n   * <code>true</code> if they are equal, <code>false</code> otherwise.\n   *\n   * @param {AxisAlignedBoundingBox} [right] The second AxisAlignedBoundingBox to compare with.\n   * @returns {Boolean} <code>true</code> if left and right are equal, <code>false</code> otherwise.\n   */\n  equals(right) {\n    return (\n      this === right ||\n      (Boolean(right) && this.minimum.equals(right.minimum) && this.maximum.equals(right.maximum))\n    );\n  }\n\n  /**\n   * Applies a 4x4 affine transformation matrix to a bounding sphere.\n   * @param transform The transformation matrix to apply to the bounding sphere.\n   * @returns itself, i.e. the modified BoundingVolume.\n   */\n  transform(transform: readonly number[]): this {\n    this.center.transformAsPoint(transform);\n    // TODO - this.halfDiagonal.transformAsVector(transform);\n    this.halfDiagonal.transform(transform);\n    this.minimum.transform(transform);\n    this.maximum.transform(transform);\n    return this;\n  }\n\n  /**\n   * Determines which side of a plane a box is located.\n   */\n  intersectPlane(plane: Plane): INTERSECTION {\n    const {halfDiagonal} = this;\n    const normal = scratchNormal.from(plane.normal);\n    const e =\n      halfDiagonal.x * Math.abs(normal.x) +\n      halfDiagonal.y * Math.abs(normal.y) +\n      halfDiagonal.z * Math.abs(normal.z);\n    const s = this.center.dot(normal) + plane.distance; // signed distance from center\n\n    if (s - e > 0) {\n      return INTERSECTION.INSIDE;\n    }\n\n    if (s + e < 0) {\n      // Not in front because normals point inward\n      return INTERSECTION.OUTSIDE;\n    }\n\n    return INTERSECTION.INTERSECTING;\n  }\n\n  /** Computes the estimated distance from the closest point on a bounding box to a point. */\n  distanceTo(point: readonly number[]): number {\n    return Math.sqrt(this.distanceSquaredTo(point));\n  }\n\n  /** Computes the estimated distance squared from the closest point on a bounding box to a point. */\n  distanceSquaredTo(point: readonly number[]): number {\n    const offset = scratchVector.from(point).subtract(this.center);\n    const {halfDiagonal} = this;\n\n    let distanceSquared = 0.0;\n    let d;\n\n    d = Math.abs(offset.x) - halfDiagonal.x;\n    if (d > 0) {\n      distanceSquared += d * d;\n    }\n\n    d = Math.abs(offset.y) - halfDiagonal.y;\n    if (d > 0) {\n      distanceSquared += d * d;\n    }\n\n    d = Math.abs(offset.z) - halfDiagonal.z;\n    if (d > 0) {\n      distanceSquared += d * d;\n    }\n\n    return distanceSquared;\n  }\n}\n"],"file":"axis-aligned-bounding-box.js"}