 Plane[Class Summary] |
 normal |
| d |
 ctor (+6 overloads) |
| Set(v1,v2,v3) (+1 overload) |
| ReverseNormal() |
| PointOnPlane()[const] |
| Transform(transform) (+3 overloads) |
| IsInPositiveDirection(directionVector)[const] |
| IsOnPositiveSide(point)[const] |
| ExamineSide(triangle)[const] |
| AreOnSameSide(p1,p2)[const] |
| Distance(point)[const] (+3 overloads) |
| SignedDistance(point)[const] |
| OrthoProjection()[const] |
| Project(point)[const] (+5 overloads) |
| ObliqueProjection(...)[const] |
| ObliqueProject(...)[const] |
| MirrorMatrix()[const] |
| Mirror(point)[const] |
| Refract(...)[const] |
| ClosestPoint(point)[const] (+2 overloads) |
| Contains(point,epsilon)[const] (+6 overloads) |
| SetEquals(plane,epsilon)[const] |
| Equals(other,epsilon)[const] |
| IsParallel(plane,epsilon)[const] |
| DihedralAngle(plane)[const] |
| Intersects(...)[const] (+14 overloads) |
| Clip(line)[const] (+3 overloads) |
| PassesThroughOrigin(epsilon)[const] |
| GenerateCircle(...)[const] |
Plane::Intersects
Syntax
bool Plane::Intersects(const Plane &plane, const Plane &plane2, Line *outLine=0, float3 *outPoint=0) const; [44 lines of code]Computes the intersection of three planes.
This function computes the intersection of this plane, and the given two planes.
Parameters
Return Value
True if the intersection was a point, in which case outPoint is written to.
Performance
49.263nsecs/call ≈ 20.3M calls/second ≈ 338.32k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
See Also
Work in progress:
Syntax
bool Plane::Intersects(const Plane &plane, Line *outLine=0) const; [24 lines of code]bool Plane::Intersects(const Ray &ray, float *d) const; [8 lines of code]
bool Plane::Intersects(const Line &line, float *d) const; [4 lines of code]
bool Plane::Intersects(const LineSegment &lineSegment, float *d) const; [9 lines of code]
bool Plane::Intersects(const Sphere &sphere) const; [4 lines of code]
bool Plane::Intersects(const AABB &aabb) const; [11 lines of code]
bool Plane::Intersects(const OBB &obb) const; [4 lines of code]
bool Plane::Intersects(const Polygon &polygon) const; [4 lines of code]
bool Plane::Intersects(const Polyhedron &polyhedron) const; [10 lines of code]
bool Plane::Intersects(const Triangle &triangle) const; [7 lines of code]
bool Plane::Intersects(const Frustum &frustum) const; [8 lines of code]
bool Plane::Intersects(const Capsule &capsule) const; [4 lines of code]
Tests whether this plane and the given object intersect.
The Plane-AABB intersection is implemented according to Christer Ericson's Real-Time Collision Detection, p.164.
Parameters
Return Value
True if the given object intersects with this plane.
Performance
bool Plane::Intersects(const Plane &plane, Line *outLine=0) const41.053nsecs/call ≈ 24.36M calls/second ≈ 405.98k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
12.316nsecs/call ≈ 81.2M calls/second ≈ 1.35M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
8.21nsecs/call ≈ 121.8M calls/second ≈ 2.03M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
0.053μsecs/call ≈ 18.74M calls/second ≈ 312.3k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
8.21nsecs/call ≈ 121.8M calls/second ≈ 2.03M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
16.421nsecs/call ≈ 60.9M calls/second ≈ 1.01M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
16.421nsecs/call ≈ 60.9M calls/second ≈ 1.01M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
3.584μsecs/call ≈ 279.03k calls/second ≈ 4.65k calls/frame (@ 60fps).
This function allocates 8 bytes (1 blocks) of temporary work memory.
This function could not be profiled. Either the function body is too small, or appropriate function parameters could not be generated.
This function allocates 16 bytes (2 blocks) of temporary work memory.
8.21nsecs/call ≈ 121.8M calls/second ≈ 2.03M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
11.207μsecs/call ≈ 89.23k calls/second ≈ 1.49k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
12.316nsecs/call ≈ 81.2M calls/second ≈ 1.35M calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
Work in progress:
Syntax
int Plane::Intersects(const Circle &circle, float3 *pt1, float3 *pt2) const; [21 lines of code]int Plane::Intersects(const Circle &circle) const; [4 lines of code]
Tests if this plane intersects with the given circle.
Parameters
Return Value
The number of intersections that occurred: 0, 1 or 2.
Performance
int Plane::Intersects(const Circle &circle, float3 *pt1, float3 *pt2) const0.099μsecs/call ≈ 10.15M calls/second ≈ 169.16k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.
0.103μsecs/call ≈ 9.74M calls/second ≈ 162.39k calls/frame (@ 60fps).
This function does not perform dynamic memory allocation.