Suppose we know the convex hull of the left half points S1 is C1 and the right half points S2 is C2. Note that all points in S1 is left to all points in S2. Given S: the set of points for which we have to find the convex hull. These algorithms exploit the fact that solutions to smaller problems can be used to solve larger problems. Further, asserts that all instances have exactly the same structure as the original problem and can be solved independently from each other, and so can easily be distributed over a number of parallel processes or threads. 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.ĭivide and conquer algorithms solve problems by dividing them into smaller instances, solving each instance recursively and merging the corresponding results to a complete solution. In this article, we have explored the divide and conquer approach towards finding the convex hull of a set of points.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |