GrahamConvexHull Class

Graham scan algorithm for finding convex hull.

Inheritance Hierarchy

SystemObject
Accord.Math.GeometryGrahamConvexHull

Namespace: Accord.Math.Geometry
Assembly: Accord.Math (in Accord.Math.dll) Version: 3.8.0

Syntax

Copy

public class GrahamConvexHull : IConvexHullAlgorithm

Public Class GrahamConvexHull
	Implements IConvexHullAlgorithm

Request Example View Source

The GrahamConvexHull type exposes the following members.

Constructors

	Name	Description
	GrahamConvexHull	Initializes a new instance of the GrahamConvexHull class

Top

Methods

	Name	Description
	Equals	Determines whether the specified object is equal to the current object. (Inherited from Object.)
	Finalize	Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.)
	FindHull	Find convex hull for the given set of points.
	GetHashCode	Serves as the default hash function. (Inherited from Object.)
	GetType	Gets the Type of the current instance. (Inherited from Object.)
	MemberwiseClone	Creates a shallow copy of the current Object. (Inherited from Object.)
	ToString	Returns a string that represents the current object. (Inherited from Object.)

Top

Extension Methods

	Name	Description
	HasMethod	Checks whether an object implements a method with the given name. (Defined by ExtensionMethods.)
	IsEqual	Compares two objects for equality, performing an elementwise comparison if the elements are vectors or matrices. (Defined by Matrix.)
	To(Type)	Overloaded. Converts an object into another type, irrespective of whether the conversion can be done at compile time or not. This can be used to convert generic types to numeric types during runtime. (Defined by ExtensionMethods.)
	ToT	Overloaded. Converts an object into another type, irrespective of whether the conversion can be done at compile time or not. This can be used to convert generic types to numeric types during runtime. (Defined by ExtensionMethods.)

Top

Remarks

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

Sample usage:

Copy

// 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 );

Reference

Accord.Math.Geometry Namespace