Quickhull Algorithm implemented in Python
-
Updated
Jan 16, 2022 - Python
#
quickhull
Here are 5 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
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
-
Updated
Jan 17, 2022 - Python
Improve this page
Add a description, image, and links to the quickhull topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the quickhull topic, visit your repo's landing page and select "manage topics."