convex-hull

D-dimensional Delaunay triangulations and convex hulls in safe Rust, with Euclidean and toroidal topologies, exact predicates, Simulation of Simplicity, multi-level validation, and bistellar flips

Recognize hand gestures in real time using MediaPipe and TensorFlow with efficient landmark detection and a lightweight neural network.

An evaluation framework for machine learning models simulating high-throughput materials discovery.

Rust implementation of Q Hull algorithm in 3D

0 K convex hulls for binary alloys, with LAMMPS as the only energy engine

A clean-slate, visuo-tactile physics simulation framework in MuJoCo. Dynamically processes robot assets and 3D CAD meshes to log tabular contact, shear, and deformation datasets. Run using python main.py with custom CLI parameters for open-loop validation or Gymnasium-compliant training.

Reproducible CHGNet relaxation-energy pilot on Materials Project LLZO structures

Scalable symbolic-numeric set computations in Julia

Planar convex hulls that support efficient insertion and removal of points

WraAct is a tool to construct the convex hull of various activation functions.

Pure-PHP planar computational geometry: area, centroid, orientation, convexity, point-in-polygon, convex intersection/union, simplify. No ext-geos.

Spherical Delaunay triangulation via 3D convex hull, with O(√N) nearest-neighbor queries

Convex hulls for 2D and 3D in Rust

Identify people by hand shape from a webcam, using classical OpenCV convex-hull analysis instead of fingerprint hardware. Educational computer vision demo, not a production biometric system.

Python implementations and benchmarks of multidimensional and temporal data structures, convex hull, skyline, and orthogonal sweep-line algorithms.

Processing Geometry Suite

A collection of Design and Analysis of Algorithms implemented in C, featuring Greedy, Divide & Conquer, and Dynamic Programming techniques with complexity analysis and experimental evaluation.

Constructive 2D computational geometry in pure Standard ML: convex hull, Delaunay triangulation, polygon clipping, area/centroid — deterministic and byte-identical on MLton and Poly/ML.

Five algorithms projects in Python: convex hull, Miller-Rabin primality, sequence alignment, Dijkstra, and TSP, each with complexity analysis

C++ and QT5 Project for Algorithms and Data Structures 2 Course