|
const int & | operator[] (const size_t _i) const noexcept |
|
size_t | GetNumVertices () const noexcept |
| Get the number of vertices in the polygon.
|
|
const Point3d & | GetPoint (const size_t _i) const noexcept |
|
Vector3d & | GetNormal () noexcept |
| Get the polygon's normal.
|
|
const Vector3d & | GetNormal () const noexcept |
|
double | GetArea () const noexcept |
| Get the polygon's area.
|
|
|
| GMSPolygon () |
|
| GMSPolygon (const int _v1, const int _v2, const int _v3, const PointList &_pts) |
|
| GMSPolygon (const_iterator _begin, const_iterator _end, const PointList &_pts) |
|
|
Iterate over the vertex indices in this polygon.
|
const_iterator | begin () const noexcept |
|
const_iterator | end () const noexcept |
|
|
void | Reverse () |
| Reverse the facing of this polygon.
|
|
void | ComputeNormal () |
| Compute the normal and area for this polygon.
|
|
|
bool | operator== (const GMSPolygon &_p) const noexcept |
|
bool | operator!= (const GMSPolygon &_p) const noexcept |
|
|
Define an ordering of polygons based on surface area.
|
bool | operator< (const GMSPolygon &_other) const noexcept |
|
bool | operator> (const GMSPolygon &_other) const noexcept |
|
|
const bool | IsTriangle () const noexcept |
| Test for three unique vertex indexes.
|
|
const Point3d | FindCenter () const noexcept |
| Find the centroid of this polygon.
|
|
const bool | PointIsAbove (const Point3d &_p) const noexcept |
|
const int | CommonVertex (const GMSPolygon &_p) const noexcept |
|
const std::pair< int, int > | CommonEdge (const GMSPolygon &_p) const noexcept |
|
Geometric structure for polygons, including vertex indexes, normal, and area. The vertex indexes refer to an external vertex list, which is required for accessing the points through this object.
Since we require triangulated models, this usually represents a triangle.