Collection of algebraic methods and data structures for collision detection
-
Updated
Dec 21, 2018 - C++
Collection of algebraic methods and data structures for collision detection
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
Collection of Course Assignments
Understanding the Quickhull Algorithm—assignment in the Algorithms VT15P4 (21AL1B) course.
Some basic algorithms for Procedural Geometry
Animating the computation of convex hulls in two dimensions.
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)
A simple convex hull algorithm visualization.
Quickhull Algorithm implemented in Python
Fast C++ multi-threaded algorithm for computing convex hulls
3D convex hull (quickhull) algorithm in Go
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
A JS library to find the convex hull of a finite set of 3d points
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Header only 3d quickhull in c99
Add a description, image, and links to the quickhull topic page so that developers can more easily learn about it.
To associate your repository with the quickhull topic, visit your repo's landing page and select "manage topics."