bool Sphere::Contains(const Polyhedron &polyhedron) const { assume(polyhedron.IsClosed()); for(int i = 0; i < polyhedron.NumVertices(); ++i) if (!Contains(polyhedron.Vertex(i))) return false; return true; }
Polyhedron AABB::ToPolyhedron() const { // Note to maintainer: This function is an exact copy of OBB:ToPolyhedron() and Frustum::ToPolyhedron(). Polyhedron p; // Populate the corners of this AABB. // The will be in the order 0: ---, 1: --+, 2: -+-, 3: -++, 4: +--, 5: +-+, 6: ++-, 7: +++. for(int i = 0; i < 8; ++i) p.v.push_back(CornerPoint(i)); // Generate the 6 faces of this AABB. const int faces[6][4] = { { 0, 1, 3, 2 }, // X- { 4, 6, 7, 5 }, // X+ { 0, 4, 5, 1 }, // Y- { 7, 6, 2, 3 }, // Y+ { 0, 2, 6, 4 }, // Z- { 1, 5, 7, 3 }, // Z+ }; for(int f = 0; f < 6; ++f) { Polyhedron::Face face; for(int v = 0; v < 4; ++v) face.v.push_back(faces[f][v]); p.f.push_back(face); } assume(p.IsClosed()); assume(p.IsConvex()); assume(p.EulerFormulaHolds()); assume(p.FaceIndicesValid()); assume(p.FacesAreNondegeneratePlanar()); assume(p.Contains(this->CenterPoint())); return p; }