A Robust 3D Convex Hull Algorithm in Java

Collection of algebraic methods and data structures for collision detection

A simple convex hull algorithm visualization.

📐 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.

Some basic algorithms for Procedural Geometry

treasure hunt problem with QuickHull algorithm

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)

Animating the computation of convex hulls in two dimensions.

Math-Info project carried out in 2020, as part of my studies in the engineering preparatory cycle.

2D convex hull algorithm with directional cone constraints and visualization tools.

python binding for quickhull

Collection of Course Assignments

Quickhull Algorithm implemented in Python

Convex hulls in 2D

Convex hulls for 2D and 3D in Rust

3D convex hull (quickhull) algorithm in Go

Fast C++ multi-threaded algorithm for computing convex hulls

Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.