Algorithm
Development Kit 1.0

Package algs.model.problems.convexhull.balanced

Defines solution to the Convex Hull problem proposed by Andrew which uses balanced binary trees to store the partial hulls, rather than linked lists.

See:
          Description

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

Package algs.model.problems.convexhull.balanced Description

Defines solution to the Convex Hull problem proposed by Andrew which uses balanced binary trees to store the partial hulls, rather than linked lists.


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.