cc7768 / CHull2d.jl

Variety of algorithms for taking the convex hull of 2 dimensional sets of points
MIT License
6 stars 2 forks source link

Possibly use 8 point Akl-Toussaint #1

Open cc7768 opened 8 years ago

cc7768 commented 8 years ago

Currently only using xmin, xmax, ymin, and ymax as points for the Akl-Toussaint algorithm. Could also get 4 other points to check which correspond to the largest (and smallest) sum and difference of (x, y) values.

Write this up and see whether it would speed the algorithm up. Lots of variation in how fast this algorithms currently are and it comes from how many points are initially pruned by Akl Toussaint.