convex-hull

Identify commercial centers using Points of Interest (POI) data by clustering these points into commercial centers/markets

Simple and lightweight convex hull in 2d

Implementação do Fecho Convexo usando divisão e conquista

Visualization of MST and convex hull

In this repository, we develop a shape descriptive framework using multi-stage polygonal approximation for computer vision based image retrieval.

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

Convex optimization over a probability simplex

Robust implementations of convex hull, plane sweep intersection, and minimum enclosing circle with benchmarking and real-world geospatial application.

Opencv-Gesture-Recognizer

Convex Hull calculation application

A collection of Algorithms in Math and Computer Science

Performant Google Maps Point Clustering

# CSC212-Term-Project Using Convex Hull in C++

Implementation of all algorithms ConvexHull and ConcaveHull on C++

Visualisation of Gift Wrapping Algorithm for calculating a convex hull.

Convex hull simulator developed as an assignment of Interactive Applications Programming course 💻 📚

C++ Build Convexhull

Implementation of Graham scan algorithm for convex hull.

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)

Computational Geometry Algorithms in Computational Theory, Showcasing Convex Hull (Graham Scan) O(nlogn), Line Segmentation Intersection O(n^2) & Point-in-Polygon O(n)