ConvexHull2D::O

Navigation

API > API/Runtime > API/Runtime/Core > API/Runtime/Core/Math > API/Runtime/Core/Math/ConvexHull2D__O

References

namespace ConvexHull2D  
{  
    &42;Scan sorted vertex from left to right to compute lower hull ConvexHull2D&58;&58;O  
    &40;  
        N  
    &41;  
}  
Copy full snippet

namespace ConvexHull2D {     &42;Scan sorted vertex from left to right to compute lower hull ConvexHull2D&58;&58;O     &40;         N     &41; }

Remarks

Andrew's monotone chain convex hull algorithm for 2-dimensional 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 2-dimensional 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 2-dimensional points. O(N log N).

Not the fastest algorithm out there, but definitely the simplest one to understand.

1 - Sort O(N log N) /**