Quick Hull is a method of computing the Convex Hull of a finite set of point in plane. This algorithm uses Divide and Conquer approach to find Convex Hull of points. The algorithm is pretty straight forward and can be easily implemented using simple recursion.
You can find the Quick Hull Algorithm here: Wikipedia_QuickHull
If you want to know about Convex Hull and its uses, follow the link here: Wikipedia_ConvexHull
I have implemented the Quick Hull algorithm using C++ and OpenGL. I have uploaded the project the GitHub. Here is the link of the Project : QuickHull2D Implementation.
Hope it helps and feel free to post your reviews :)
I have implemented the Quick Hull algorithm using C++ and OpenGL. I have uploaded the project the GitHub. Here is the link of the Project : QuickHull2D Implementation.
Hope it helps and feel free to post your reviews :)
0 comments:
Post a Comment