Material Shadows for android : A library for supporting convex material shadows

Geometry Processing Library for Python

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

A lean C++ library for working with point cloud data

Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki

Hull, Delaunay and Voronoi algorithms in Unity

A .Net fast convex hull library for 2, 3, and higher dimensions.

Interactive browser visualizations for materials science: crystal structures/molecules, trajectories, convex hulls, phase diagrams, Fermi surfaces, bands+DOS, Brillouin zones, etc.

Voronoi / Delaunay tessellations on the sphere

Scalable symbolic-numeric set computations in Julia

An implementation in Unity of the Quickhull algorithm for generating 3D convex hulls

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

Processing Geometry Suite

Polyhedral Computation Interface

Compile programs directly into transformer weights. Includes a 2D convex-hull KV cache with O(log n) inference.

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

An implementation of the Graham's Scan Convex Hull algorithm in JavaScript.

Blender 2.80 add-on that enables the use of V-HACD inside Blender to generate accurate convex hulls quickly.

Pyhull is a Python wrapper to Qhull (http://www.qhull.org/) for the computation of the convex hull, Delaunay triangulation and Voronoi diagram.

Convex hull of given 3D points

Simplexes with Minimum Volume Enclosing Polynomial Curves

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

delaunay triangulation in 3D space, to reconstruct convex hull from spherical dot cloud

The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.

LiDAR processing ROS2. Segmentation: "Fast Ground Segmentation for 3D LiDAR Point Cloud Based on Jump-Convolution-Process". Clustering: "Curved-Voxel Clustering for Accurate Segmentation of 3D LiDAR Point Clouds with Real-Time Performance".

Javascript implementation of Andrew's Monotone Chain convex hull algorithm. Useful for Google Maps work.

BtOgre is a very thin and small Bullet-Ogre connection. This wrapper does not try to provide its own RigidBody or CollisionShape classes. Instead, you talk directly with Bullet. The only thing it does is connect the btRigidBodies (only rigid bodies for now, I'm still not good with soft bodies) to their SceneNodes, convert Ogre meshes to Bullet convex hulls and triangle meshes etc., provide a debug drawing mechanism, and a Bullet-Ogre vector/quaternion conversion utility.

Concave or convex hull around a list of points.

Robust and fast 2D convex hull