public bool TestIntersection(GeoAABB2 aabb) { if (mFlatTreeList == null || mFlatTreeList.Count == 0) { return(false); } int closer, other; BVHTraversal[] todo = new BVHTraversal[64]; todo[0] = new BVHTraversal(); int stackptr = 0; todo[stackptr].mIndex = 0; todo[stackptr].mLength = -9999999.0f; while (stackptr >= 0) { int ni = todo[stackptr].mIndex; float near = todo[stackptr].mLength; stackptr--; BVHFlatNode2 node = mFlatTreeList[ni]; // 对叶节点做相交测试 if (node.mRightOffset == 0) { bool hit = false; for (int o = 0; o < node.mLeafCount; ++o) { BVHObject2 obj = mBuildPrims[(int)node.mStartIndex + o]; hit = obj.TestAABBIntersect(aabb); if (hit) { return(true); } } } else { closer = ni + 1; other = ni + (int)node.mRightOffset; // 对父结点做测试 bool hitc0 = GeoAABBUtils.IsAABBInsectAABB2(aabb.mMin, aabb.mMax, mFlatTreeList[closer].mBox.mMin, mFlatTreeList[closer].mBox.mMax); bool hitc1 = GeoAABBUtils.IsAABBInsectAABB2(aabb.mMin, aabb.mMax, mFlatTreeList[other].mBox.mMin, mFlatTreeList[other].mBox.mMax); if (hitc0 && hitc1) { todo[++stackptr] = new BVHTraversal(other, -9999); todo[++stackptr] = new BVHTraversal(closer, -9999); } else if (hitc0) { todo[++stackptr] = new BVHTraversal(closer, -9999); } else if (hitc1) { todo[++stackptr] = new BVHTraversal(other, -9999); } } } return(false); }
public List <Vector2> RayCastAll(Vector2 rayP, Vector2 direction) { List <Vector2> allPoints = new List <Vector2>(); if (mFlatTreeList.Count == 0) { return(allPoints); } int closer, other; BVHTraversal[] todo = new BVHTraversal[64]; todo[0] = new BVHTraversal(); int stackptr = 0; todo[stackptr].mIndex = 0; todo[stackptr].mLength = -9999999.0f; while (stackptr >= 0) { int ni = todo[stackptr].mIndex; float near = todo[stackptr].mLength; stackptr--; BVHFlatNode2 node = mFlatTreeList[ni]; // 对叶节点做相交测试 if (node.mRightOffset == 0) { allPoints.Add(node.mBox.mMin); allPoints.Add(node.mBox.mMax); } else { closer = ni + 1; other = ni + (int)node.mRightOffset; // 对父结点做测试 GeoInsectPointArrayInfo in1 = new GeoInsectPointArrayInfo(); GeoInsectPointArrayInfo in2 = new GeoInsectPointArrayInfo(); bool hitc0 = GeoRayUtils.IsRayInsectAABB2(rayP, direction, mFlatTreeList[closer].mBox.mMin, mFlatTreeList[closer].mBox.mMax, ref in1); bool hitc1 = GeoRayUtils.IsRayInsectAABB2(rayP, direction, mFlatTreeList[other].mBox.mMin, mFlatTreeList[other].mBox.mMax, ref in2); if (hitc0 && hitc1) { Vector2 v1 = in1.mHitGlobalPoint[0]; Vector2 v2 = in2.mHitGlobalPoint[0]; float l0 = (v1 - rayP).magnitude; float l2 = (v2 - rayP).magnitude; if (l2 < l0) { float temp = l0; l0 = l2; l2 = temp; int itemp = closer; closer = other; other = itemp; } todo[++stackptr] = new BVHTraversal(other, l2); todo[++stackptr] = new BVHTraversal(closer, l0); } else if (hitc0) { Vector2 v1 = in1.mHitGlobalPoint[0]; float l0 = (v1 - rayP).magnitude; todo[++stackptr] = new BVHTraversal(closer, l0); } else if (hitc1) { Vector2 v2 = in2.mHitGlobalPoint[0]; float l2 = (v2 - rayP).magnitude; todo[++stackptr] = new BVHTraversal(other, l2); } } } return(allPoints); }
public bool GetIntersection(GeoRay2 ray, ref GeoInsectPointArrayInfo intersection, bool occlusion) { if (mFlatTreeList.Count == 0) { return(false); } intersection.mIsIntersect = false; intersection.mLength = 999999999.0f; intersection.mHitObject2 = null; int closer, other; BVHTraversal[] todo = new BVHTraversal[64]; todo[0] = new BVHTraversal(); int stackptr = 0; todo[stackptr].mIndex = 0; todo[stackptr].mLength = -9999999.0f; while (stackptr >= 0) { int ni = todo[stackptr].mIndex; float near = todo[stackptr].mLength; stackptr--; BVHFlatNode2 node = mFlatTreeList[ni]; //if (near > intersection.mLength) // a bug here. may ignore closer object // continue; // 对叶节点做相交测试 if (node.mRightOffset == 0) { bool hit = false; for (int o = 0; o < node.mLeafCount; ++o) { GeoInsectPointArrayInfo current = new GeoInsectPointArrayInfo(); BVHObject2 obj = mBuildPrims[(int)node.mStartIndex + o]; hit = obj.IsIntersect(ref ray, ref current); if (hit) { if (occlusion) { intersection = current; return(true); } if (current.mLength < intersection.mLength) { intersection = current; } } } } else { closer = ni + 1; other = ni + (int)node.mRightOffset; // 对父结点做测试 GeoInsectPointArrayInfo in1 = new GeoInsectPointArrayInfo(); GeoInsectPointArrayInfo in2 = new GeoInsectPointArrayInfo(); bool hitc0 = GeoRayUtils.IsRayInsectAABB2(ray.mOrigin, ray.mDirection, mFlatTreeList[closer].mBox.mMin, mFlatTreeList[closer].mBox.mMax, ref in1); bool hitc1 = GeoRayUtils.IsRayInsectAABB2(ray.mOrigin, ray.mDirection, mFlatTreeList[other].mBox.mMin, mFlatTreeList[other].mBox.mMax, ref in2); if (hitc0 && hitc1) { Vector2 v1 = in1.mHitGlobalPoint[0]; Vector2 v2 = in2.mHitGlobalPoint[0]; float l1 = (v1 - ray.mOrigin).magnitude; float l2 = (v2 - ray.mOrigin).magnitude; if (l2 < l1) // 近的先处理,放在栈顶 { todo[++stackptr] = new BVHTraversal(closer, l1); todo[++stackptr] = new BVHTraversal(other, l2); } else { todo[++stackptr] = new BVHTraversal(other, l2); todo[++stackptr] = new BVHTraversal(closer, l1); } } else if (hitc0) { Vector2 v1 = in1.mHitGlobalPoint[0]; float l0 = (v1 - ray.mOrigin).magnitude; todo[++stackptr] = new BVHTraversal(closer, l0); } else if (hitc1) { Vector2 v2 = in2.mHitGlobalPoint[0]; float l2 = (v2 - ray.mOrigin).magnitude; todo[++stackptr] = new BVHTraversal(other, l2); } } } if (intersection.mHitObject2 != null) { intersection.mHitGlobalPoint.Clear(); intersection.mHitGlobalPoint.Add(ray.mOrigin + ray.mDirection * intersection.mLength); } return(intersection.mHitObject2 != null); }
public bool GetIntersection(GeoRay3 ray, ref GeoInsectPointArrayInfo intersection, bool occlusion) { intersection.mIsIntersect = false; intersection.mLength = 999999999.0f; intersection.mHitObject2 = null; int closer, other; BVHTraversal[] todo = new BVHTraversal[64]; todo[0] = new BVHTraversal(); int stackptr = 0; todo[stackptr].mIndex = 0; todo[stackptr].mLength = -9999999.0f; while (stackptr >= 0) { int ni = todo[stackptr].mIndex; float near = todo[stackptr].mLength; stackptr--; BVHFlatNode3 node = mFlatTreeList[ni]; if (near > intersection.mLength) { continue; } // 对叶节点做相交测试 if (node.mRightOffset == 0) { bool hit = false; for (int o = 0; o < node.mLeafCount; ++o) { GeoInsectPointArrayInfo current = new GeoInsectPointArrayInfo(); BVHObject3 obj = mBuildPrims[(int)node.mStartIndex + o]; hit = obj.IsIntersect(ref ray, ref current); if (hit) { if (occlusion) { intersection = current; return(true); } if (current.mLength < intersection.mLength) { intersection = current; } } } } else { closer = ni + 1; other = ni + (int)node.mRightOffset; // 对父结点做测试 GeoInsectPointArrayInfo in1 = new GeoInsectPointArrayInfo(); GeoInsectPointArrayInfo in2 = new GeoInsectPointArrayInfo(); bool hitc0 = GeoRayUtils.IsRayInsectAABB3(ray.mOrigin, ray.mDirection, mFlatTreeList[closer].mBox.mMin, mFlatTreeList[closer].mBox.mMax, ref in1); bool hitc1 = GeoRayUtils.IsRayInsectAABB3(ray.mOrigin, ray.mDirection, mFlatTreeList[other].mBox.mMin, mFlatTreeList[other].mBox.mMax, ref in2); if (hitc0 && hitc1) { float l0 = (in1.mHitGlobalPoint[0] - ray.mOrigin).magnitude; float l2 = (in2.mHitGlobalPoint[0] - ray.mOrigin).magnitude; if (l2 < l0) { float temp = l0; l0 = l2; l2 = temp; int itemp = closer; closer = other; other = itemp; } todo[++stackptr] = new BVHTraversal(other, l2); todo[++stackptr] = new BVHTraversal(closer, l0); } else if (hitc0) { float l0 = (in1.mHitGlobalPoint[0] - ray.mOrigin).magnitude; todo[++stackptr] = new BVHTraversal(closer, l0); } else if (hitc1) { float l2 = (in2.mHitGlobalPoint[0] - ray.mOrigin).magnitude; todo[++stackptr] = new BVHTraversal(other, l2); } } } if (intersection.mHitObject2 != null) { intersection.mHitGlobalPoint.Clear(); intersection.mHitGlobalPoint.mPointArray.Add(ray.mOrigin + ray.mDirection * intersection.mLength); intersection.mIsIntersect = true; } return(intersection.mHitObject2 != null); }