Quickhull Algorithm implemented in Python
-
Updated
Jan 16, 2022 - Python
#
quickhull
Here are 7 public repositories matching this topic...
-
Updated
Feb 28, 2019 - Python
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 quickhull computational-geometry convex-hull divide-and-conquer graham-scan-algorithm incremental-algorithm gift-wrapping-algorithm
-
Updated
Jul 24, 2023 - Python
📐 This project implements various computational geometry algorithms, focusing on convex hulls, linear programming, Delaunay triangulation, and geometric search. The code is organized into multiple modules, each solving specific geometry-related problems and demonstrating core computational methods.
kd-tree linear-programming quickhull computational-geometry scipy convex-hull matplotlib voronoi-diagram delaunay-triangulation range-search divide-and-conquer graham-scan gift-wrapping-algorithm
-
Updated
Nov 10, 2024 - Python
Computational geometry library in Python: four 2D convex-hull algorithms (gift wrapping, quickhull, divide-and-conquer, incremental), 3D gift wrapping, Delaunay via lifting, KD-tree, and a from-scratch LP solver. UoA DI Computational Geometry course. Solo project.
python kd-tree linear-programming university-project quickhull computational-geometry convex-hull delaunay-triangulation gift-wrapping
-
Updated
May 11, 2026 - Python
2D convex hull algorithm with directional cone constraints and visualization tools.
-
Updated
Aug 11, 2025 - Python
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
-
Updated
Jan 17, 2022 - Python
Add this topic to your repo
To associate your repository with the quickhull topic, visit your repo's landing page and select "manage topics."