 OBB[Class Summary] |
 pos |
| r |
| axis |
 ctor (+1 overload) |
| SetNegativeInfinity() |
| SetFrom(aabb) (+6 overloads) |
| SetFromApproximate(...) |
| ToPolyhedron()[const] |
| MinimalEnclosingAABB()[const] |
| MaximalContainedAABB()[const] |
| MinimalEnclosingSphere()[const] |
| MaximalContainedSphere()[const] |
| Size()[const] |
| HalfSize()[const] |
| Diagonal()[const] |
| HalfDiagonal()[const] |
| WorldToLocal()[const] |
| LocalToWorld()[const] |
| IsFinite()[const] |
| IsDegenerate()[const] |
| CenterPoint()[const] |
| Centroid()[const] |
| Volume()[const] |
| SurfaceArea()[const] |
| PointInside(x,y,z)[const] |
| Edge(edgeIndex)[const] |
| CornerPoint(cornerIndex)[const] |
| PointOnEdge(edgeIndex,u)[const] |
| FaceCenterPoint(faceIndex)[const] |
| FacePoint(faceIndex,u,v)[const] |
| FacePlane(faceIndex)[const] |
| GetCornerPoints(outPointArray)[const] |
| GetFacePlanes(outPlaneArray)[const] |
| RandomPointInside(rng)[const] |
| RandomPointOnSurface(rng)[const] |
| RandomPointOnEdge(rng)[const] |
| RandomCornerPoint(rng)[const] |
| Translate(offset) |
| Scale(...) (+1 overload) |
| Transform(transform) (+3 overloads) |
| ClosestPoint(point)[const] |
| Distance(point)[const] (+1 overload) |
| Contains(point)[const] (+7 overloads) |
| Intersects(aabb)[const] (+11 overloads) |
| Enclose(point) |
| Triangulate(...)[const] |
| ToEdgeList(outPos)[const] |
| ExtremePointsAlongDirection(...)[static] |
| PCAEnclosingOBB(...)[static] |
| NumVerticesInTriangulation(...)[static] |
| NumVerticesInEdgeList()[static] |
OBB::MinimalEnclosingAABB
Syntax
AABB OBB::MinimalEnclosingAABB() const; [6 lines of code]Returns the tightest AABB that contains this OBB.
This function computes the optimal minimum volume AABB that encloses this OBB.
Note
Since an AABB cannot generally represent an OBB, this conversion is not exact, but the returned AABB specifies a larger volume.
Performance
41.053nsecs/call ≈ 24.36M calls/second ≈ 405.98k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.