quickhull
There are 22 repositories under quickhull topic.
Habrador/Computational-geometry
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
qhull/qhull
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
karimnaaji/3d-quickhull
Header only 3d quickhull in c99
mauriciopoppe/quickhull3d
A JS library to find the convex hull of a finite set of 3d points
leomccormack/convhull_3d
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
tomilov/quickhull
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
markus-wa/quickhull-go
3D convex hull (quickhull) algorithm in Go
andreacasalino/Fast-Quick-hull
Fast C++ multi-threaded algorithm for computing convex hulls
AnantJoshiCZ/QuickHull
Quickhull Algorithm implemented in Python
szabolcsdombi/python-quickhull
python binding for quickhull
NishanthPrajith/Convex_Hull_Visualization
A simple convex hull algorithm visualization.
alexvek96/convex_hull_algorithms
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)
ermel272/convex-hull-animations
Animating the computation of convex hulls in two dimensions.
mandafigura/personal-projects
Some basic algorithms for Procedural Geometry
tomasaschan/QuickHull.jl
Convex hulls in 2D
Godlike/Epona
Collection of algebraic methods and data structures for collision detection
Nikos25K/Computational-Geometry
📐 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.
Thorkel-dev/Enveloppe-Convexe
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
ankesh007/Parallel-Programming
Collection of Course Assignments
PantelisKyriakidis/QuickHull
treasure hunt problem with QuickHull algorithm