1 line
17 KiB
Plaintext
1 line
17 KiB
Plaintext
|
{"version":3,"file":"Octree.cjs","sources":["../../src/math/Octree.js"],"sourcesContent":["import { Box3, Line3, Plane, Sphere, Triangle, Vector3 } from 'three'\nimport { Capsule } from '../math/Capsule'\n\nconst _v1 = /* @__PURE__ */ new Vector3()\nconst _v2 = /* @__PURE__ */ new Vector3()\nconst _plane = /* @__PURE__ */ new Plane()\nconst _line1 = /* @__PURE__ */ new Line3()\nconst _line2 = /* @__PURE__ */ new Line3()\nconst _sphere = /* @__PURE__ */ new Sphere()\nconst _capsule = /* @__PURE__ */ new Capsule()\n\nclass Octree {\n constructor(box) {\n this.triangles = []\n this.box = box\n this.subTrees = []\n }\n\n addTriangle(triangle) {\n if (!this.bounds) this.bounds = new Box3()\n\n this.bounds.min.x = Math.min(this.bounds.min.x, triangle.a.x, triangle.b.x, triangle.c.x)\n this.bounds.min.y = Math.min(this.bounds.min.y, triangle.a.y, triangle.b.y, triangle.c.y)\n this.bounds.min.z = Math.min(this.bounds.min.z, triangle.a.z, triangle.b.z, triangle.c.z)\n this.bounds.max.x = Math.max(this.bounds.max.x, triangle.a.x, triangle.b.x, triangle.c.x)\n this.bounds.max.y = Math.max(this.bounds.max.y, triangle.a.y, triangle.b.y, triangle.c.y)\n this.bounds.max.z = Math.max(this.bounds.max.z, triangle.a.z, triangle.b.z, triangle.c.z)\n\n this.triangles.push(triangle)\n\n return this\n }\n\n calcBox() {\n this.box = this.bounds.clone()\n\n // offset small amount to account for regular grid\n this.box.min.x -= 0.01\n this.box.min.y -= 0.01\n this.box.min.z -= 0.01\n\n return this\n }\n\n split(level) {\n if (!this.box) return\n\n const subTrees = []\n const halfsize = _v2.copy(this.box.max).sub(this.box.min).multiplyScalar(0.5)\n\n for (let x = 0; x < 2; x++) {\n for (let y = 0; y < 2; y++) {\n for (let z = 0; z < 2; z++) {\n const box = new Box3()\n const v = _v1.set(x, y, z)\n\n box.min.copy(this.box.min).add(v.multiply(halfsize))\n box.max.copy(box.min).add(halfsize)\n\n subTrees.push(new Octree(box))\n }\n }\n }\n\n let triangle\n\n while ((triangle = this.triangles.pop())) {\n for (let i = 0; i < subTrees.length; i++) {\n if (subTrees[i].box.intersectsTriangle(triangle)) {\n subTrees[i].triangles.push(triangle)\n }\n }\n }\n\n for (let i = 0; i < subTrees.length; i++) {\n const len = subTrees[i].triangles.length\n\n if (len > 8 && level < 16) {\n subTrees[i].split(level + 1)\n }\n\n if (len !== 0) {\n this.subTrees.push(subTrees[i])\n }\n }\n\n return this\n }\n\n build() {\n this.calcBox()\n this.split(0)\n\n return this\n }\n\n getRayTriangles(ray, triangles) {\n for (let i = 0; i < this.subTrees.length; i++) {\n const subTree = this.subTrees[i]\n if (!ray.intersectsBox(subTree.box)) continue\n\n if (subTree.triangles.length > 0) {\n for (let j = 0; j < subTree.triangles.length; j++) {\n if (triangles.indexOf(subTree.triangles[j]) === -1) triangles.push(subTree.triangles[j])\n }\n } else {\n subTree.getRayTriangles(ray, triangles)\n }\n }\n\n return triangles\n }\n\n triangleCapsuleIntersect(capsule, triangle) {\n triangle.getPlane(_plane)\n\n const d1 = _plane.distanceToPoint(capsule.start) - capsule.radius\n const d2 = _plane.distanceToPoint(capsule.end) - capsule.radius\n\n if ((d1 > 0 && d2 > 0) || (d1 < -capsule.radius && d2 < -capsule.radius)) {\n return false\n }\n\n const delta = Math.abs(d1 / (Math.abs(d1) + Math.abs(d2)))\n const intersectPoint = _v1.copy(capsule.start).lerp(capsule.end, delta)\n\n if (triangle.containsPoint(intersectPoint)) {\n return { normal: _plane.normal.clone(), point: intersectPoint.clone(), depth: Math.abs(Math.min(d1, d2)) }\n }\n\n const r2 = capsule.radius * capsule.radius\n\n const line1 = _line1.set(capsule.start, capsule.end)\n\n const lines = [\n [triangle.a, triangle.b],\n [triangle.b, triangle.c],\n [triangle.
|