[NEW ALGORITHM] Convex Hull using Graham’s Scan or Andrew's Monotone Chain

AlgoGenesis / C

AlgoGenesis is a centralized open-source platform dedicated to providing optimized and well-documented algorithm implementations in C. Perfect for both beginners and advanced users, this repository serves as a comprehensive learning resource for solving algorithmic challenges.

MIT License

89 stars 303 forks source link

[NEW ALGORITHM] Convex Hull using Graham’s Scan or Andrew's Monotone Chain #1223

Closed shriyadindi closed 1 month ago

shriyadindi commented 1 month ago

Convex Hull using Graham’s Scan or Andrew's Monotone Chain

Description: Convex Hull algorithms find the smallest convex boundary around a set of points, useful in computational geometry. Key Skills: Sorting, geometric calculations, understanding of stack-based structures. Complexity: Moderate; geometric logic and stack usage can be challenging in C.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level2

Assignees:

[x] Contributor in GSSoC-ext
[x] Want to work on it

pankaj-bind commented 1 month ago

Do not create unnecessary multiple issues