fast concave hull python package
-
Updated
Jan 1, 2024 - Rust
fast concave hull python package
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)
An application for visualizing the working of two convex hull algorithms - Jarvis March and Kirkpatrick-Seidel in two dimensions.
Convex Hull Algorithms for COMP0005 (UCL 1st Year Course)
Add a description, image, and links to the gift-wrapping-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the gift-wrapping-algorithm topic, visit your repo's landing page and select "manage topics."