 Polyhedron[Class Summary] |
 v |
| f |
 ctor |
| NumVertices()[const] |
| NumFaces()[const] |
| NumEdges()[const] |
| VertexArrayPtr() (+1 overload) |
| Vertex(vertexIndex)[const] |
| Edge(edgeIndex)[const] |
| Edges()[const] |
| Faces()[const] |
| EdgeIndices()[const] |
| FacePolygon(faceIndex)[const] |
| FacePlane(faceIndex)[const] |
| FaceNormal(faceIndex)[const] |
| ExtremeVertex(direction)[const] |
| ExtremePoint(direction)[const] |
| ProjectToAxis(...)[const] |
| ConvexCentroid()[const] |
| ApproximateConvexCentroid()[const] |
| SurfaceArea()[const] |
| Volume()[const] |
| MinimalEnclosingAABB()[const] |
| MergeAdjacentPlanarFaces() |
| FaceIndicesValid()[const] |
| FlipWindingOrder() |
| OrientNormalsOutsideConvex() |
| RemoveRedundantVertices() |
| IsNull()[const] |
| IsClosed()[const] |
| IsConvex()[const] |
| EulerFormulaHolds()[const] |
| FacesAreNondegeneratePlanar(epsilon)[const] |
| ClipLineSegmentToConvexPolyhedron(...)[const] |
| NearestVertex(point)[const] |
| Contains(point)[const] (+7 overloads) |
| FaceContains(...)[const] |
| FaceContainmentDistance2D(...)[const] |
| ContainsConvex(point,epsilon)[const] (+2 overloads) |
| ClosestPoint(...)[const] (+2 overloads) |
| ClosestPointConvex(point)[const] |
| Distance(point)[const] |
| Intersects(lineSegment)[const] (+11 overloads) |
| IntersectsConvex(line)[const] (+2 overloads) |
| MergeConvex(point) |
| Translate(offset) |
| Transform(transform) (+3 overloads) |
| SetEquals(p2) |
| SwapVertices(i,j) |
| CanonicalizeFaceArray() |
| ContainsFace(face)[const] |
| FindClosestVertex(pt,outDistanceSq)[const] |
| Triangulate()[const] |
| ToString()[const] |
| ConvexHull(...)[static] |
| Tetrahedron(...)[static] |
| Octahedron(...)[static] |
| Hexahedron(...)[static] |
| Icosahedron(...)[static] |
| Dodecahedron(...)[static] |
Polyhedron::IntersectsConvex
Syntax
bool Polyhedron::IntersectsConvex(const Line &line) const; [6 lines of code]bool Polyhedron::IntersectsConvex(const Ray &ray) const; [6 lines of code]
bool Polyhedron::IntersectsConvex(const LineSegment &lineSegment) const; [6 lines of code]
Tests whether this
This function is exactly like Intersects(), but this version assumes that this polyhedron is convex, and uses a faster method of testing the intersection.
Note
This function assumes that this polyhedron is closed and the edges are not self-intersecting.
Return Value
True if an intersection occurs or one of the objects is contained inside the other, false otherwise.
See Also
Work in progress:
Todo: in bool Polyhedron::IntersectsConvex(const Line &line) const:
Add Intersects(Circle/Disc).