 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::IsDegenerate
Syntax
bool Polygon::IsDegenerate(float epsilon=1e-4f) const; [4 lines of code]Tests if this polygon is degenerate.
A polygon is degenerate if it has two or less vertices, or if its surface area is less or equal than the given epsilon.
Note
The null polygon is degenerate and finite.