[NEW ALGORITHM] Chan's Algorithm for Convex Hull

[V2VaibhavVerma]

I propose adding Chan's Algorithm to the repository for computing the convex hull of a set of points in two-dimensional space. This algorithm utilizes a divide-and-conquer approach combined with the use of dynamic data structures, achieving an expected time complexity of (O(n \log h)), where (n) is the number of input points and (h) is the number of points in the convex hull. This implementation will provide a robust solution for users needing efficient convex hull computation, especially in applications involving computational geometry.

Key Features of Chan's Algorithm:

• Efficient handling of large datasets.
• Integration of dynamic data structures for better performance.
• Improved time complexity compared to simpler algorithms like the gift-wrapping method.

Proposed Implementation Details:

• Implementation in C language.
• Detailed comments and documentation for clarity.
• Test cases to validate the algorithm against various input scenarios.

Labels:
new algorithm, gssoc-ext, hacktoberfest, level1

Assignees:
Contributor in GSSoC-ext
Want to work on it

[github-actions]

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

[V2VaibhavVerma]

@pankaj-bind Kindly review this algo, assign me this task under labels.

[pankaj-bind]

assigned