Material Shadows for android : A library for supporting convex material shadows

Code from O'Rourke book "Computational Geometry algorithms in C" 1997

A repository containing a C implementation of the Graham Scan Convex Hull algorithm

convex hull by using Graham's Scan Algorithm

My implementation of Graham's Scan Algorithm for finding the convex hull of a finite set of points in the plane with time complexity O(N*log(N)).

This program implements convex hull for a set of coordinates using Graham's Scan algorithm.

Matches a sequence of GPS coordinates to road graph

The Astro Spiral project presents an innovative way to compare astronomical images of the sky by building a convex spiral (modification of the Graham Scan algorithm for convex hull) according to the bright objects in a photo. On that purpose, I made an application for Windows and Mac OS X, written in C++ that uses the Cinder toolbox.

Implementation of an O(n log n) algorithm for the Smallest Enclosing Circle and the Voronoi Diagram, using efficient structures (Red‑Black tree, HashMap) with a JavaFX GUI.

A demo of the Graham Scan algorithm in Java

Point triangulation using Graham’s scan

A simple convex hull algorithm visualization.

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

Animating the computation of convex hulls in two dimensions.

C++ implementation of convex hulls using the Graham Scan Algorithm

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)

Convex Hull Algorithms for COMP0005 (UCL 1st Year Course)

Python based implementation of different algorithms for finding convex hull of a set of points in two dimensional space