RetroSearch Browse

Showing content from http://accord-framework.net/docs/html/T_Accord_Math_Geometry_IConvexHullAlgorithm.htm below:

IConvexHullAlgorithm Interface

Interface defining methods for algorithms, which search for convex hull of the specified points' set.

Namespace: Accord.Math.Geometry
Assembly:

Accord.Math (in Accord.Math.dll) Version: 3.8.0

Syntax

The IConvexHullAlgorithm type exposes the following members.

Methods Name Description FindHull

Find convex hull for the given set of points.

Top Remarks

The interface defines a method, which should be implemented by different classes performing convex hull search for specified set of points.

Note All algorithms, implementing this interface, should follow two rules for the found convex hull:

the first point in the returned list is the point with lowest X coordinate (and with lowest Y if there are several points with the same X value);
points in the returned list are given in counter clockwise order (Cartesian coordinate system).

See Also

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4