Class ConvexHullGrahamScan_F32

java.lang.Object
georegression.fitting.polygon.ConvexHullGrahamScan_F32
All Implemented Interfaces:
FitConvexHull_F32

@Generated("georegression.fitting.polygon.ConvexHullGrahamScan_F64") public class ConvexHullGrahamScan_F32 extends Object implements FitConvexHull_F32
Finds the convex hull using Graham Scan. Runtime complexity of O(n log n).
  • Constructor Details

    • ConvexHullGrahamScan_F32

      public ConvexHullGrahamScan_F32()
  • Method Details

    • process

      public void process(FastAccess<Point2D_F32> points, Polygon2D_F32 output)
      Fits a convex hull to the provided set of points. The list is modified by changing the order of points inside of it. If the input is a degenerate case where there is no clear solution it will do the following: A single point will return a single point. If all points lie along a line (2 or more points) then a polygon that's composed of two points will be returned.
      Specified by:
      process in interface FitConvexHull_F32
      Parameters:
      points - (Input, Output) Point that the convex hull is fit to. This list will be re-ordered.
      output - (Output) The found convex hull.