Understanding the Quickhull Algorithm—assignment in the Algorithms VT15P4 (21AL1B) course.
-
Updated
Feb 15, 2017 - C
Understanding the Quickhull Algorithm—assignment in the Algorithms VT15P4 (21AL1B) course.
Header only 3d quickhull in c99
Animating the computation of convex hulls in two dimensions.
Collection of algebraic methods and data structures for collision detection
Collection of Course Assignments
Some basic algorithms for Procedural Geometry
A simple convex hull algorithm visualization.
Quickhull Algorithm implemented in Python
Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
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
3D convex hull (quickhull) algorithm in Go
A JS library to find the convex hull of a finite set of 3d points
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)
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."