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
파일 보기 프로젝트 열기: holisticware-admin/MonoVersal.AForgeNET 1 사용 예제들

공개 메소드들

메소드 설명
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