public bool IsIntersect(ref GeoRay3 dist, ref GeoInsectPointArrayInfo insect) { bool isInsect = GeoRayUtils.IsRayInsectAABB2(dist.mOrigin, dist.mDirection, mAABB3.mMin, mAABB3.mMax, ref insect); if (isInsect) { insect.mHitObject2 = this; insect.mLength = (insect.mHitGlobalPoint.mPointArray[0] - dist.mOrigin).magnitude; } return(isInsect); }
public bool IsIntersect(ref GeoRay3 dist, ref GeoInsectPointArrayInfo insect) { GeoInsectPointInfo info = new GeoInsectPointInfo(); bool isInsect = GeoRayUtils.IsRayInsectTriangle3(dist.mOrigin, dist.mDirection, mP1, mP2, mP3, ref info); if (isInsect) { insect.mHitObject2 = this; insect.mHitGlobalPoint.mPointArray.Add(info.mHitGlobalPoint); insect.mLength = (info.mHitGlobalPoint - dist.mOrigin).magnitude; } return(isInsect); }
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) // 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(); 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); }