Module 

Header 
/Engine/Source/Runtime/Core/Public/Math/ConvexHull2d.h 
Include 
#include "Math/ConvexHull2d.h" 
namespace ConvexHull2D
{
*Scan sorted vertex from left to right to compute lower hull ConvexHull2D::O
(
N
)
}
Andrew's monotone chain convex hull algorithm for 2dimensional points. O(N log N).
Not the fastest algorithm out there, but definitely the simplest one to understand.
1  Sort O(N log N) /** Andrew's monotone chain convex hull algorithm for 2dimensional points. O(N log N).
Not the fastest algorithm out there, but definitely the simplest one to understand.
1  Sort O(N log N) /**
Andrew's monotone chain convex hull algorithm for 2dimensional points. O(N log N).
Not the fastest algorithm out there, but definitely the simplest one to understand.
1  Sort O(N log N) /**