Skip to content
#

graham-scan-algorithm

Here are 49 public repositories matching this topic...

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 graham-scan-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the graham-scan-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more