Algorithm
Development Kit 1.0

Package algs.model.problems.convexhull.bucket

Defines solution to the Convex Hull problem which uses BucketSort to sort the points prior to invoking Andrew's algorithm.

See:
          Description

Class Summary
BucketAndrew Computes Convex Hull following Andrew's Algorithm.
 

Package algs.model.problems.convexhull.bucket Description

Defines solution to the Convex Hull problem which uses BucketSort to sort the points prior to invoking Andrew's algorithm. We can use BucketSort even though the data set represents two dimensional points because Andrew's ConvexHullScan algorithm needs to order the points from left to right


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.