GitHub / alexvek96 / convex_hull_algorithms
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)
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexvek96%2Fconvex_hull_algorithms
PURL: pkg:github/alexvek96/convex_hull_algorithms
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 509 KB
Dependencies parsed at: Pending
Created at: almost 2 years ago
Updated at: almost 2 years ago
Pushed at: almost 2 years ago
Last synced at: almost 2 years ago
Topics: computational-geometry, convex-hull, divide-and-conquer, gift-wrapping-algorithm, graham-scan-algorithm, incremental-algorithm, python, quickhull