| 67 | } |
| 68 | |
| 69 | void FoliageCluster::UpdateCullDistance() |
| 70 | { |
| 71 | if (Children[0]) |
| 72 | { |
| 73 | Children[0]->UpdateCullDistance(); |
| 74 | Children[1]->UpdateCullDistance(); |
| 75 | Children[2]->UpdateCullDistance(); |
| 76 | Children[3]->UpdateCullDistance(); |
| 77 | |
| 78 | MaxCullDistance = Children[0]->MaxCullDistance; |
| 79 | MaxCullDistance = Math::Max(MaxCullDistance, Children[1]->MaxCullDistance); |
| 80 | MaxCullDistance = Math::Max(MaxCullDistance, Children[2]->MaxCullDistance); |
| 81 | MaxCullDistance = Math::Max(MaxCullDistance, Children[3]->MaxCullDistance); |
| 82 | } |
| 83 | else if (Instances.HasItems()) |
| 84 | { |
| 85 | MaxCullDistance = Instances[0]->CullDistance; |
| 86 | for (int32 i = 1; i < Instances.Count(); i++) |
| 87 | { |
| 88 | MaxCullDistance = Math::Max(MaxCullDistance, Instances[i]->CullDistance); |
| 89 | } |
| 90 | } |
| 91 | else |
| 92 | { |
| 93 | MaxCullDistance = 0; |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | bool FoliageCluster::Intersects(Foliage* foliage, const Ray& ray, Real& distance, Vector3& normal, FoliageInstance*& instance) |
| 98 | { |