Skip to content
/ convex_hull_algorithms Public

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)

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

alexvek96/convex_hull_algorithms

Error
Looks like something went wrong!

About

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)

Topics

python quickhull computational-geometry convex-hull divide-and-conquer graham-scan-algorithm incremental-algorithm gift-wrapping-algorithm

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages