Divide and Conquer algorithm to find Convex Hull

Reading time: 25 minutes | Coding time: 12 minutes

In this article, we have explored the divide and conquer approach towards finding the convex hull of a set of points. The key idea is that is we have two convex hull then, they can be merged in linear time to get a convex hull of a larger set of points.

This is a companion discussion topic for the original entry at http://iq.opengenus.org/divide-and-conquer-convex-hull/
1 Like

very interesting article Thank you