Algorithm
Development Kit 1.0

Package algs.model.problems.convexhull.slowhull

Defines solution to the Convex Hull problem that relies on a Brute Force n^4 algorithm to check each potential triangle and removes points that fall within the triangle.

See:
          Description

Class Summary
SlowHull Computes Convex Hull using a brute force approach that computes all n^3 triangles and removes points that are within a triangle.
 

Package algs.model.problems.convexhull.slowhull Description

Defines solution to the Convex Hull problem that relies on a Brute Force n^4 algorithm to check each potential triangle and removes points that fall within the triangle. Provided as "straw man" implementation to show the efficiency of ConvexHullScan.


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.