-
Updated
Feb 28, 2019 - Python
quickhull
Here are 4 public repositories matching this topic...
Quickhull Algorithm implemented in Python
-
Updated
Jan 16, 2022 - Python
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
-
Updated
Jan 17, 2022 - 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)
-
Updated
Jul 24, 2023 - Python
Improve this page
Add a description, image, and links to the quickhull topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the quickhull topic, visit your repo's landing page and select "manage topics."