Description: The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.
To Search:
- [Convex_hull_problem] - Convex hull problem (divide and conquer
- [box] - Analysis and design of algorithms using
File list (Check if you may need any files):
convex hull\convex.dvi.pdf
convex hull
Download