Quickhull Algorithm implemented in Python
-
Updated
Jan 16, 2022 - Python
Quickhull Algorithm implemented in Python
1st/2 Assignment of the "Computational Geometry" course (Spring Semester 2023 - NKUA). Python implementations of the following algorithms to compute the convex hull of N-points: Incremental (Graham's Scan) (2D and 3D), Quickhull (2D and 3D), Divide and Conquer (2D), Gift Wrapping (2D)
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
Add a description, image, and links to the quickhull topic page so that developers can more easily learn about it.
To associate your repository with the quickhull topic, visit your repo's landing page and select "manage topics."