 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::Edge
Syntax
LineSegment OBB::Edge(int edgeIndex) const; [20 lines of code]Returns an edge of this OBB.
Parameters
intedgeIndexThe index of the edge line segment to get, in the range [0, 11].
Performance
32.842nsecs/call ≈ 30.45M calls/second ≈ 507.48k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
See Also
Work in progress:
Todo: in LineSegment OBB::Edge(int edgeIndex) const:
Draw a diagram that shows which index generates which edge.