| 1 |
- {"ast":null,"code":"import { SmartArrayNoDuplicate } from \"../../Misc/smartArray.js\";\nimport { OctreeBlock } from \"./octreeBlock.js\";\n/**\n * Octrees are a really powerful data structure that can quickly select entities based on space coordinates.\n * @see https://doc.babylonjs.com/features/featuresDeepDive/scene/optimizeOctrees\n */\nexport class Octree {\n /**\n * Creates a octree\n * @see https://doc.babylonjs.com/features/featuresDeepDive/scene/optimizeOctrees\n * @param creationFunc function to be used to instantiate the octree\n * @param maxBlockCapacity defines the maximum number of meshes you want on your octree's leaves (default: 64)\n * @param maxDepth defines the maximum depth (sub-levels) for your octree. Default value is 2, which means 8 8 8 = 512 blocks :) (This parameter takes precedence over capacity.)\n */\n constructor(creationFunc, maxBlockCapacity, /** [2] Defines the maximum depth (sub-levels) for your octree. Default value is 2, which means 8 8 8 = 512 blocks :) (This parameter takes precedence over capacity.) */\n maxDepth = 2) {\n this.maxDepth = maxDepth;\n /**\n * Content stored in the octree\n */\n this.dynamicContent = [];\n this._maxBlockCapacity = maxBlockCapacity || 64;\n this._selectionContent = new SmartArrayNoDuplicate(1024);\n this._creationFunc = creationFunc;\n }\n // Methods\n /**\n * Updates the octree by adding blocks for the passed in meshes within the min and max world parameters\n * @param worldMin worldMin for the octree blocks var blockSize = new Vector3((worldMax.x - worldMin.x) / 2, (worldMax.y - worldMin.y) / 2, (worldMax.z - worldMin.z) / 2);\n * @param worldMax worldMax for the octree blocks var blockSize = new Vector3((worldMax.x - worldMin.x) / 2, (worldMax.y - worldMin.y) / 2, (worldMax.z - worldMin.z) / 2);\n * @param entries meshes to be added to the octree blocks\n */\n update(worldMin, worldMax, entries) {\n OctreeBlock._CreateBlocks(worldMin, worldMax, entries, this._maxBlockCapacity, 0, this.maxDepth, this, this._creationFunc);\n }\n /**\n * Adds a mesh to the octree\n * @param entry Mesh to add to the octree\n */\n addMesh(entry) {\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.addEntry(entry);\n }\n }\n /**\n * Remove an element from the octree\n * @param entry defines the element to remove\n */\n removeMesh(entry) {\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.removeEntry(entry);\n }\n }\n /**\n * Selects an array of meshes within the frustum\n * @param frustumPlanes The frustum planes to use which will select all meshes within it\n * @param allowDuplicate If duplicate objects are allowed in the resulting object array\n * @returns array of meshes within the frustum\n */\n select(frustumPlanes, allowDuplicate) {\n this._selectionContent.reset();\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.select(frustumPlanes, this._selectionContent, allowDuplicate);\n }\n if (allowDuplicate) {\n this._selectionContent.concat(this.dynamicContent);\n } else {\n this._selectionContent.concatWithNoDuplicate(this.dynamicContent);\n }\n return this._selectionContent;\n }\n /**\n * Test if the octree intersect with the given bounding sphere and if yes, then add its content to the selection array\n * @param sphereCenter defines the bounding sphere center\n * @param sphereRadius defines the bounding sphere radius\n * @param allowDuplicate defines if the selection array can contains duplicated entries\n * @returns an array of objects that intersect the sphere\n */\n intersects(sphereCenter, sphereRadius, allowDuplicate) {\n this._selectionContent.reset();\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.intersects(sphereCenter, sphereRadius, this._selectionContent, allowDuplicate);\n }\n if (allowDuplicate) {\n this._selectionContent.concat(this.dynamicContent);\n } else {\n this._selectionContent.concatWithNoDuplicate(this.dynamicContent);\n }\n return this._selectionContent;\n }\n /**\n * Test if the octree intersect with the given ray and if yes, then add its content to resulting array\n * @param ray defines the ray to test with\n * @returns array of intersected objects\n */\n intersectsRay(ray) {\n this._selectionContent.reset();\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.intersectsRay(ray, this._selectionContent);\n }\n this._selectionContent.concatWithNoDuplicate(this.dynamicContent);\n return this._selectionContent;\n }\n}\n/**\n * Adds a mesh into the octree block if it intersects the block\n * @param entry defines the mesh to try to add to the block\n * @param block defines the block where the mesh should be added\n */\nOctree.CreationFuncForMeshes = (entry, block) => {\n const boundingInfo = entry.getBoundingInfo();\n if (!entry.isBlocked && boundingInfo.boundingBox.intersectsMinMax(block.minPoint, block.maxPoint)) {\n block.entries.push(entry);\n }\n};\n/**\n * Adds a submesh into the octree block if it intersects the block\n * @param entry defines the submesh to try to add to the block\n * @param block defines the block where the submesh should be added\n */\nOctree.CreationFuncForSubMeshes = (entry, block) => {\n const boundingInfo = entry.getBoundingInfo();\n if (boundingInfo.boundingBox.intersectsMinMax(block.minPoint, block.maxPoint)) {\n block.entries.push(entry);\n }\n};","map":{"version":3,"names":["SmartArrayNoDuplicate","OctreeBlock","Octree","constructor","creationFunc","maxBlockCapacity","maxDepth","dynamicContent","_maxBlockCapacity","_selectionContent","_creationFunc","update","worldMin","worldMax","entries","_CreateBlocks","addMesh","entry","index","blocks","length","block","addEntry","removeMesh","removeEntry","select","frustumPlanes","allowDuplicate","reset","concat","concatWithNoDuplicate","intersects","sphereCenter","sphereRadius","intersectsRay","ray","CreationFuncForMeshes","boundingInfo","getBoundingInfo","isBlocked","boundingBox","intersectsMinMax","minPoint","maxPoint","push","CreationFuncForSubMeshes"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/@babylonjs/core/Culling/Octrees/octree.js"],"sourcesContent":["import { SmartArrayNoDuplicate } from \"../../Misc/smartArray.js\";\nimport { OctreeBlock } from \"./octreeBlock.js\";\n/**\n * Octrees are a really powerful data structure that can quickly select entities based on space coordinates.\n * @see https://doc.babylonjs.com/features/featuresDeepDive/scene/optimizeOctrees\n */\nexport class Octree {\n /**\n * Creates a octree\n * @see https://doc.babylonjs.com/features/featuresDeepDive/scene/optimizeOctrees\n * @param creationFunc function to be used to instantiate the octree\n * @param maxBlockCapacity defines the maximum number of meshes you want on your octree's leaves (default: 64)\n * @param maxDepth defines the maximum depth (sub-levels) for your octree. Default value is 2, which means 8 8 8 = 512 blocks :) (This parameter takes precedence over capacity.)\n */\n constructor(creationFunc, maxBlockCapacity, \n /** [2] Defines the maximum depth (sub-levels) for your octree. Default value is 2, which means 8 8 8 = 512 blocks :) (This parameter takes precedence over capacity.) */\n maxDepth = 2) {\n this.maxDepth = maxDepth;\n /**\n * Content stored in the octree\n */\n this.dynamicContent = [];\n this._maxBlockCapacity = maxBlockCapacity || 64;\n this._selectionContent = new SmartArrayNoDuplicate(1024);\n this._creationFunc = creationFunc;\n }\n // Methods\n /**\n * Updates the octree by adding blocks for the passed in meshes within the min and max world parameters\n * @param worldMin worldMin for the octree blocks var blockSize = new Vector3((worldMax.x - worldMin.x) / 2, (worldMax.y - worldMin.y) / 2, (worldMax.z - worldMin.z) / 2);\n * @param worldMax worldMax for the octree blocks var blockSize = new Vector3((worldMax.x - worldMin.x) / 2, (worldMax.y - worldMin.y) / 2, (worldMax.z - worldMin.z) / 2);\n * @param entries meshes to be added to the octree blocks\n */\n update(worldMin, worldMax, entries) {\n OctreeBlock._CreateBlocks(worldMin, worldMax, entries, this._maxBlockCapacity, 0, this.maxDepth, this, this._creationFunc);\n }\n /**\n * Adds a mesh to the octree\n * @param entry Mesh to add to the octree\n */\n addMesh(entry) {\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.addEntry(entry);\n }\n }\n /**\n * Remove an element from the octree\n * @param entry defines the element to remove\n */\n removeMesh(entry) {\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.removeEntry(entry);\n }\n }\n /**\n * Selects an array of meshes within the frustum\n * @param frustumPlanes The frustum planes to use which will select all meshes within it\n * @param allowDuplicate If duplicate objects are allowed in the resulting object array\n * @returns array of meshes within the frustum\n */\n select(frustumPlanes, allowDuplicate) {\n this._selectionContent.reset();\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.select(frustumPlanes, this._selectionContent, allowDuplicate);\n }\n if (allowDuplicate) {\n this._selectionContent.concat(this.dynamicContent);\n }\n else {\n this._selectionContent.concatWithNoDuplicate(this.dynamicContent);\n }\n return this._selectionContent;\n }\n /**\n * Test if the octree intersect with the given bounding sphere and if yes, then add its content to the selection array\n * @param sphereCenter defines the bounding sphere center\n * @param sphereRadius defines the bounding sphere radius\n * @param allowDuplicate defines if the selection array can contains duplicated entries\n * @returns an array of objects that intersect the sphere\n */\n intersects(sphereCenter, sphereRadius, allowDuplicate) {\n this._selectionContent.reset();\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.intersects(sphereCenter, sphereRadius, this._selectionContent, allowDuplicate);\n }\n if (allowDuplicate) {\n this._selectionContent.concat(this.dynamicContent);\n }\n else {\n this._selectionContent.concatWithNoDuplicate(this.dynamicContent);\n }\n return this._selectionContent;\n }\n /**\n * Test if the octree intersect with the given ray and if yes, then add its content to resulting array\n * @param ray defines the ray to test with\n * @returns array of intersected objects\n */\n intersectsRay(ray) {\n this._selectionContent.reset();\n for (let index = 0; index < this.blocks.length; index++) {\n const block = this.blocks[index];\n block.intersectsRay(ray, this._selectionContent);\n }\n this._selectionContent.concatWithNoDuplicate(this.dynamicContent);\n return this._selectionContent;\n }\n}\n/**\n * Adds a mesh into the octree block if it intersects the block\n * @param entry defines the mesh to try to add to the block\n * @param block defines the block where the mesh should be added\n */\nOctree.CreationFuncForMeshes = (entry, block) => {\n const boundingInfo = entry.getBoundingInfo();\n if (!entry.isBlocked && boundingInfo.boundingBox.intersectsMinMax(block.minPoint, block.maxPoint)) {\n block.entries.push(entry);\n }\n};\n/**\n * Adds a submesh into the octree block if it intersects the block\n * @param entry defines the submesh to try to add to the block\n * @param block defines the block where the submesh should be added\n */\nOctree.CreationFuncForSubMeshes = (entry, block) => {\n const boundingInfo = entry.getBoundingInfo();\n if (boundingInfo.boundingBox.intersectsMinMax(block.minPoint, block.maxPoint)) {\n block.entries.push(entry);\n }\n};\n"],"mappings":"AAAA,SAASA,qBAAqB,QAAQ,0BAA0B;AAChE,SAASC,WAAW,QAAQ,kBAAkB;AAC9C;AACA;AACA;AACA;AACA,OAAO,MAAMC,MAAM,CAAC;EAChB;AACJ;AACA;AACA;AACA;AACA;AACA;EACIC,WAAWA,CAACC,YAAY,EAAEC,gBAAgB,EAC1C;EACAC,QAAQ,GAAG,CAAC,EAAE;IACV,IAAI,CAACA,QAAQ,GAAGA,QAAQ;IACxB;AACR;AACA;IACQ,IAAI,CAACC,cAAc,GAAG,EAAE;IACxB,IAAI,CAACC,iBAAiB,GAAGH,gBAAgB,IAAI,EAAE;IAC/C,IAAI,CAACI,iBAAiB,GAAG,IAAIT,qBAAqB,CAAC,IAAI,CAAC;IACxD,IAAI,CAACU,aAAa,GAAGN,YAAY;EACrC;EACA;EACA;AACJ;AACA;AACA;AACA;AACA;EACIO,MAAMA,CAACC,QAAQ,EAAEC,QAAQ,EAAEC,OAAO,EAAE;IAChCb,WAAW,CAACc,aAAa,CAACH,QAAQ,EAAEC,QAAQ,EAAEC,OAAO,EAAE,IAAI,CAACN,iBAAiB,EAAE,CAAC,EAAE,IAAI,CAACF,QAAQ,EAAE,IAAI,EAAE,IAAI,CAACI,aAAa,CAAC;EAC9H;EACA;AACJ;AACA;AACA;EACIM,OAAOA,CAACC,KAAK,EAAE;IACX,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,IAAI,CAACC,MAAM,CAACC,MAAM,EAAEF,KAAK,EAAE,EAAE;MACrD,MAAMG,KAAK,GAAG,IAAI,CAACF,MAAM,CAACD,KAAK,CAAC;MAChCG,KAAK,CAACC,QAAQ,CAACL,KAAK,CAAC;IACzB;EACJ;EACA;AACJ;AACA;AACA;EACIM,UAAUA,CAACN,KAAK,EAAE;IACd,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,IAAI,CAACC,MAAM,CAACC,MAAM,EAAEF,KAAK,EAAE,EAAE;MACrD,MAAMG,KAAK,GAAG,IAAI,CAACF,MAAM,CAACD,KAAK,CAAC;MAChCG,KAAK,CAACG,WAAW,CAACP,KAAK,CAAC;IAC5B;EACJ;EACA;AACJ;AACA;AACA;AACA;AACA;EACIQ,MAAMA,CAACC,aAAa,EAAEC,cAAc,EAAE;IAClC,IAAI,CAAClB,iBAAiB,CAACmB,KAAK,CAAC,CAAC;IAC9B,KAAK,IAAIV,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,IAAI,CAACC,MAAM,CAACC,MAAM,EAAEF,KAAK,EAAE,EAAE;MACrD,MAAMG,KAAK,GAAG,IAAI,CAACF,MAAM,CAACD,KAAK,CAAC;MAChCG,KAAK,CAACI,MAAM,CAACC,aAAa,EAAE,IAAI,CAACjB,iBAAiB,EAAEkB,cAAc,CAAC;IACvE;IACA,IAAIA,cAAc,EAAE;MAChB,IAAI,CAAClB,iBAAiB,CAACoB,MAAM,CAAC,IAAI,CAACtB,cAAc,CAAC;IACtD,CAAC,MACI;MACD,IAAI,CAACE,iBAAiB,CAACqB,qBAAqB,CAAC,IAAI,CAACvB,cAAc,CAAC;IACrE;IACA,OAAO,IAAI,CAACE,iBAAiB;EACjC;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;EACIsB,UAAUA,CAACC,YAAY,EAAEC,YAAY,EAAEN,cAAc,EAAE;IACnD,IAAI,CAAClB,iBAAiB,CAACmB,KAAK,CAAC,CAAC;IAC9B,KAAK,IAAIV,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,IAAI,CAACC,MAAM,CAACC,MAAM,EAAEF,KAAK,EAAE,EAAE;MACrD,MAAMG,KAAK,GAAG,IAAI,CAACF,MAAM,CAACD,KAAK,CAAC;MAChCG,KAAK,CAACU,UAAU,CAACC,YAAY,EAAEC,YAAY,EAAE,IAAI,CAACxB,iBAAiB,EAAEkB,cAAc,CAAC;IACxF;IACA,IAAIA,cAAc,EAAE;MAChB,IAAI,CAAClB,iBAAiB,CAACoB,MAAM,CAAC,IAAI,CAACtB,cAAc,CAAC;IACtD,CAAC,MACI;MACD,IAAI,CAACE,iBAAiB,CAACqB,qBAAqB,CAAC,IAAI,CAACvB,cAAc,CAAC;IACrE;IACA,OAAO,IAAI,CAACE,iBAAiB;EACjC;EACA;AACJ;AACA;AACA;AACA;EACIyB,aAAaA,CAACC,GAAG,EAAE;IACf,IAAI,CAAC1B,iBAAiB,CAACmB,KAAK,CAAC,CAAC;IAC9B,KAAK,IAAIV,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,IAAI,CAACC,MAAM,CAACC,MAAM,EAAEF,KAAK,EAAE,EAAE;MACrD,MAAMG,KAAK,GAAG,IAAI,CAACF,MAAM,CAACD,KAAK,CAAC;MAChCG,KAAK,CAACa,aAAa,CAACC,GAAG,EAAE,IAAI,CAAC1B,iBAAiB,CAAC;IACpD;IACA,IAAI,CAACA,iBAAiB,CAACqB,qBAAqB,CAAC,IAAI,CAACvB,cAAc,CAAC;IACjE,OAAO,IAAI,CAACE,iBAAiB;EACjC;AACJ;AACA;AACA;AACA;AACA;AACA;AACAP,MAAM,CAACkC,qBAAqB,GAAG,CAACnB,KAAK,EAAEI,KAAK,KAAK;EAC7C,MAAMgB,YAAY,GAAGpB,KAAK,CAACqB,eAAe,CAAC,CAAC;EAC5C,IAAI,CAACrB,KAAK,CAACsB,SAAS,IAAIF,YAAY,CAACG,WAAW,CAACC,gBAAgB,CAACpB,KAAK,CAACqB,QAAQ,EAAErB,KAAK,CAACsB,QAAQ,CAAC,EAAE;IAC/FtB,KAAK,CAACP,OAAO,CAAC8B,IAAI,CAAC3B,KAAK,CAAC;EAC7B;AACJ,CAAC;AACD;AACA;AACA;AACA;AACA;AACAf,MAAM,CAAC2C,wBAAwB,GAAG,CAAC5B,KAAK,EAAEI,KAAK,KAAK;EAChD,MAAMgB,YAAY,GAAGpB,KAAK,CAACqB,eAAe,CAAC,CAAC;EAC5C,IAAID,YAAY,CAACG,WAAW,CAACC,gBAAgB,CAACpB,KAAK,CAACqB,QAAQ,EAAErB,KAAK,CAACsB,QAAQ,CAAC,EAAE;IAC3EtB,KAAK,CAACP,OAAO,CAAC8B,IAAI,CAAC3B,KAAK,CAAC;EAC7B;AACJ,CAAC","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}
|
