#include <ConvexHull2.h>
|
| void | GetHull (TFunctionRef< TVector2< RealType >(int32)> GetPointFunc, TArray< int32 > &Merged, int32 &IdxFirst, int32 &IdxLast) |
| |
| void | Merge (TFunctionRef< TVector2< RealType >(int32)> GetPointFunc, TArray< int32 > &Merged, int32 j0, int32 j1, int32 j2, int32 j3, int32 &i0, int32 &i1) |
| |
| void | GetTangent (TFunctionRef< TVector2< RealType >(int32)> GetPointFunc, TArray< int32 > &Merged, int32 j0, int32 j1, int32 j2, int32 j3, int32 &i0, int32 &i1) |
| |
◆ Empty()
Empty any previously-computed convex hull data. Frees the hull memory. Note: You do not need to call this before calling Solve() with new data.
◆ GetDimension()
- Returns
- Number of dimensions spanned by the input points.
◆ GetHull()
template<class RealType >
◆ GetLine()
- Returns
- the line spanned by a collinear input. Only meaningful if GetDimension() == 1
◆ GetNumUniquePoints()
Number of unique points considered by convex hull construction (excludes exact duplicate points and filtered-out points)
◆ GetPolygonIndices()
- Returns
- the calculated polygon vertices, as indices into the point set passed to Solve()
◆ GetTangent()
template<class RealType >
◆ IsSolutionAvailable()
- Returns
- true if convex hull is available
◆ Merge()
template<class RealType >
◆ Solve() [1/3]
template<class RealType >
Generate convex hull as long as input is not degenerate If input is degenerate, this will return false, and caller can call GetDimension() to determine whether the points were collinear, or all the same point
- Parameters
-
| NumPoints | Number of points to consider |
| GetPointFunc | Function providing array-style access into points |
| FilterFunc | Optional filter to include only a subset of the points in the output hull |
- Returns
- true if hull was generated, false if points span < 2 dimensions
◆ Solve() [2/3]
Generate convex hull as long as input is not degenerate If input is degenerate, this will return false, and caller can call GetDimension() to determine whether the points were collinear, or all the same point
- Parameters
-
| Points | Array of points to consider |
- Returns
- true if hull was generated, false if points span < 2 dimensions
◆ Solve() [3/3]
Generate convex hull as long as input is not degenerate If input is degenerate, this will return false, and caller can call GetDimension() to determine whether the points were collinear, or all the same point
- Parameters
-
| Points | Array of points to consider |
| Filter | Optional filter to include only a subset of the points in the output hull |
- Returns
- true if hull was generated, false if points span < 2 dimensions
◆ SolveSimplePolygon()
Generate convex hull for a simple polygon If input has fewer than 3 points, will return false If input is not a simple polygon (e.g. if it has self-intersections), may not find a correct hull
- Parameters
-
| NumPolygonPoints | Number of points in the polygon |
| GetPointFunc | Function providing array-style access into the polygon points |
| bIsKnownCCW | If true, will save some processing time by assuming input is wound counter-clockwise |
- Returns
- true if a hull was generated
◆ Dimension
◆ Hull
◆ NumUniquePoints
The documentation for this class was generated from the following files: