ConvexHull2d Class

Namespace: IGS.Genamo
Assembly: Genamo (in Genamo.dll)

Various algorithms used to compute convex hulls

C++

JScript

Copy

Public Class ConvexHull2d

This language is not supported or no code example is available.

C++

JScript

Copy

public static class ConvexHull2d

This language is not supported or no code example is available.

C++

JScript

Copy

public ref class ConvexHull2d

This language is not supported or no code example is available.

C++

JScript

Copy

public class ConvexHull2d

This language is not supported or no code example is available.

	Name	Description
	ConcaveParts(Poly2d, Poly2d)	Extracts the concave parts of a convex hull. chull must be the convex hull of pl
	GrahamScan(List<Point2d>)
	GrahamScan(Poly2d)
	GrahamScan(Region2d)	Assumes r is vectorized
	GrahamScanOLD(List<Point2d>)	The classical graham scan algorithm. Computes the points of a convex hull.
	GrahamScanPoly(List<Point2d>, List<Point2d>)
	Melkman(Poly2d)	Returns an array of integer indices of the polyline V. V has to be simple without bulget segments. Computation time is linear. Result will have ccw direction. The point with lowest index of V that is on hull will be the first point of the result.
	MelkmanPoly(Poly2d)	Returns the convex hull of a simple polygon. V has to be simple without bulget segments. Computation time is linear. Result will have ccw direction.

IGS.Genamo.ConvexHull2d

Supported in: 4.5, 4.5.1, 4.5.2, 4.6, 4.6.1, 4.6.2, 4.7, 4.7.1, 4.7.2, 4.8