[SSoC'23] Convex Hull (using Graham's Scan) Algorithm

[Avdhesh-Varshney]

Is your feature request related to a problem? Please describe.

• The problem is to efficiently compute the convex hull of a set of points in a 2D plane.

Describe the solution you'd like

• An attractive algorithm, Convex Hull (Graham's Scan), that can determine the outer boundary of the given points.
• This algorithm should be efficient and provide a reliable convex hull representation for further analysis or visualization.

Describe alternatives you've considered

• Brute force approach by checking every possible combination of points, which can be computationally expensive for large datasets.

[Avdhesh-Varshney]

@Kumar-laxmi Please assign this algorithm to contribute in SSoC'23 program I can write this code in C, C++, PYTHON & JAVA in all languages. As i have completed this code in C, C++ and PYTHON language so i am ready to make a pull request and contribute in this repository. /assign

[Avdhesh-Varshney]

@Kumar-laxmi Please assign this task to me. I want to create a pull request as i have done this task. So, please assign this task for a successful contribution under SSoC 2.0 I am also completed it in C, C++, PYTHON and JAVA in all languages.

[Avdhesh-Varshney]

@Kumar-laxmi please assign this program and want to create a pull request as i have done this program in C, C++, Java and python languages. So, i requested to assign this issue to me for a successful contribution under SSoC 2.0 program

[Avdhesh-Varshney]

@Kumar-laxmi @zugzwang03 @Arun9739 @072arushi Sirs, I have created this issue 3 weeks ago and i have done with this project and want to create a pull request and contribute under SSoC 2.0 program

Please assign this task to me for a successful contribution

[github-actions[bot]]

Stale issue message