C# Класс Project290.Physics.Common.ConvexHull.Melkman

Открытые методы

Метод	Описание
GetConvexHull ( Vertices vertices ) : Vertices	Creates a convex hull of the Vertices. Note: Vertices must be of a simple polygon, i.e. edges do not overlap. Implemented using Melkman's Convex Hull Algorithm - O(n) time complexity. Reference: http://www.ams.sunysb.edu/~jsbm/courses/345/melkman.pdf Requires that vertices are of a simple polygon. Handles collinear points.

Описание методов

GetConvexHull() публичный статический Метод

Creates a convex hull of the Vertices. Note: Vertices must be of a simple polygon, i.e. edges do not overlap.

Implemented using Melkman's Convex Hull Algorithm - O(n) time complexity. Reference: http://www.ams.sunysb.edu/~jsbm/courses/345/melkman.pdf Requires that vertices are of a simple polygon. Handles collinear points.

public static GetConvexHull ( Vertices vertices ) : Vertices
vertices	Vertices
Результат	Vertices