Demonstrate “quickhull” implementation in javascript

Quickhull is an algorithm that is similar to the quicksort using a divide and conquer strategy to find the convex hull for scattered points. The green line in the plot is the initial base line and gray lines are the intermediate base line. The final convex hull is shown in red.



source code: qh.js


< 

, programming

Leave a Comment

Your email address will not be published. Required fields are marked *


7 × = forty nine

WP-SpamFree by Pole Position Marketing