convex hull by using Graham's Scan Algorithm
-
Updated
Jul 20, 2019 - Python
convex hull by using Graham's Scan Algorithm
In this repository, we develop a shape descriptive framework using multi-stage polygonal approximation for computer vision based image retrieval.
Solutions of common Computational geometry problems
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)
Python based implementation of different algorithms for finding convex hull of a set of points in two dimensional space
The Convex Hull of a given a set of points in the plane
Graham's scan algorithm for finding convex hull
🧮 Implementation of Convex Hull Algorithms in Python
Solution for "Computer Graphics" Course assignments, 2-nd year
Comparison of three different python convex hull algorithms
Add a description, image, and links to the graham-scan-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the graham-scan-algorithm topic, visit your repo's landing page and select "manage topics."