C# Класс AForge.Math.Geometry.GrahamConvexHull

Graham scan algorithm for finding convex hull.

The class implements Graham scan algorithm for finding convex hull of a given set of points.

Sample usage:

// generate some random points Random rand = new Random( ); List<IntPoint> points = new List<IntPoint>( ); for ( int i = 0; i < 10; i++ ) { points.Add( new IntPoint( rand.Next( 200 ) - 100, rand.Next( 200 ) - 100 ) ); } // find the convex hull IConvexHullAlgorithm hullFinder = new GrahamConvexHull( ); List<IntPoint> hull = hullFinder.FindHull( points );
Наследование: IConvexHullAlgorithm
Показать файл Открыть проект Примеры использования класса

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

Метод Описание
FindHull ( List points ) : List

Find convex hull for the given set of points.

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

FindHull() публичный метод

Find convex hull for the given set of points.
public FindHull ( List points ) : List
points List Set of points to search convex hull for.
Результат List