 Polygon[Class Summary] |
 p |
 ctor |
| NumEdges()[const] |
| NumVertices()[const] |
| VertexArrayPtr() (+1 overload) |
| AnyPointFast()[const] |
| Vertex(vertexIndex)[const] |
| Edge(edgeIndex)[const] |
| Edge2D(edgeIndex)[const] |
| EdgeNormal(edgeIndex)[const] |
| EdgePlane(edgeIndex)[const] |
| ExtremePoint(direction)[const] (+1 overload) |
| ProjectToAxis(...)[const] |
| DiagonalExists(i,j)[const] |
| Diagonal(i,j)[const] |
| IsConvex()[const] |
| IsPlanar(epsilonSq)[const] |
| IsSimple()[const] |
| IsNull()[const] |
| IsFinite()[const] |
| IsDegenerate(epsilon)[const] |
| BasisU()[const] |
| BasisV()[const] |
| MapTo2D(i)[const] (+1 overload) |
| MapFrom2D(point)[const] |
| NormalCCW()[const] |
| NormalCW()[const] |
| PlaneCCW()[const] |
| PlaneCW()[const] |
| Translate(offset) |
| Transform(transform) (+3 overloads) |
| Contains(...)[const] (+3 overloads) |
| Contains2D(...)[const] |
| Intersects(line)[const] (+11 overloads) |
| ConvexIntersects(aabb)[const] (+2 overloads) |
| ClosestPoint(...)[const] (+2 overloads) |
| Distance(point)[const] |
| Area()[const] |
| Perimeter()[const] |
| Centroid()[const] |
| CenterPoint()[const] |
| PointOnEdge(normalizedDistance)[const] |
| RandomPointOnEdge(rng)[const] |
| FastRandomPointInside(rng)[const] |
| ToPolyhedron()[const] |
| Triangulate()[const] |
| MinimalEnclosingAABB()[const] |
| ToString()[const] |
| SerializeToString()[const] |
| Equals(other)[const] |
| BitEquals(other)[const] |
| NumFaces()[static] |
| FromString(str,outEndStr)[static] (+1 overload) |
Polygon::Intersects
Syntax
bool Polygon::Intersects(const Line &line) const; [7 lines of code]bool Polygon::Intersects(const Ray &ray) const; [7 lines of code]
bool Polygon::Intersects(const LineSegment &lineSegment) const; [10 lines of code]
bool Polygon::Intersects(const Plane &plane) const; [15 lines of code]
bool Polygon::Intersects(const AABB &aabb) const; [9 lines of code]
bool Polygon::Intersects(const OBB &obb) const; [9 lines of code]
bool Polygon::Intersects(const Triangle &triangle, float polygonThickness=1e-3f) const; [4 lines of code]
bool Polygon::Intersects(const Polygon &polygon, float polygonThickness=1e-3f) const; [4 lines of code]
bool Polygon::Intersects(const Frustum &frustum) const; [9 lines of code]
bool Polygon::Intersects(const Polyhedron &polyhedron) const; [4 lines of code]
bool Polygon::Intersects(const Sphere &sphere) const; [10 lines of code]
bool Polygon::Intersects(const Capsule &capsule) const; [10 lines of code]
Tests whether this polygon and the given object intersect.
Both objects are treated as "solid", meaning that if one of the objects is fully contained inside another, this function still returns true. This test is performed in the global (world) space of this polygon.
Note
These functions assume that this polygon might be concave, which requires a significantly slower test. If you know ahead of time that this polygon is convex, you can instead use one of the faster ConvexIntersects() functions.
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 Polygon::Intersects(const Line &line) const:
Add Intersects(Circle/Disc).
Todo: in bool Polygon::Intersects(const Sphere &sphere) const:
Optimize.
Todo: in bool Polygon::Intersects(const Capsule &capsule) const:
Optimize.