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

Voronoi / Delaunay tessellations on the sphere

Scalable symbolic-numeric set computations in Julia

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

Processing Geometry Suite

Polyhedral Computation Interface

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

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.

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

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

Concave Hull boundary polygon for an array of points and concave and convex polygon vertex detection

c++ implementation of 3D incremental convell hull algorthim

１．算法与数据结构库；２．已经实现动态数组／双向链表／栈／队列／堆／链式哈希表／二叉搜索树／红黑树．均以C++模板类实现，可用于实际项目中替代STL的容器类及数据结构学习．３．已经实现图／深度优先／广度优先／单源最短路径／所有结点对最短路径／最小生成树／快速排序／归并排序／字符串匹配算法．可用于实际项目及算法学习．４．对分治／迭代算法设计方法进行总结，对动态规划／贪心算法针对几个经典问题做了具体实现．

Code from O'Rourke book "Computational Geometry algorithms in C" 1997

A Typescript library for multidimensional convex hulling and Delaunay triangulations.

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

Delaunay triangulations, Voronoi, convex hull and more. Ported to Haxe 3 from https://github.com/sledorze/hxDelaunay (itself a port of the excellent https://github.com/nodename/as3delaunay)

Julia package for calculating 2D concave/convex hulls

We help the deaf and the dumb to communicate with normal people using hand gesture to speech conversion. In this code we use depth maps from the kinect camera and techniques like convex hull + contour mapping to recognise 5 hand signs

C++ code for computing the convex hull of a polygon

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