Module |
|
Header |
/Engine/Plugins/Experimental/GeometryProcessing/Source/GeometryAlgorithms/Public/ConvexHull2.h |
Include |
#include "ConvexHull2.h" |
template<typename RealType>
class TConvexHull2
Name | Description | ||
---|---|---|---|
|
Empty() |
Empty any previously-computed convex hull data. |
|
|
GetDimension() |
||
|
GetHull |
Divide-and-conquer algorithm |
|
|
GetNumUniquePoints() |
Number of unique points considered by convex hull construction (excludes exact duplicate points and filtered-out points) |
|
|
GetPolygonIndices() |
||
|
GetTangent |
||
|
IsSolutionAvailable() |
||
|
Merge |
||
|
Solve ( |
Default FilterFunc version of the above Solve(); workaround for clang bug https://bugs.llvm.org/show_bug.cgi?id=25333 |
|
|
Solve ( |
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 |
|
|
Solve ( |
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 |