18 results found Sort:

Material Shadows for android : A library for supporting convex material shadows
Created 2017-05-28
60 commits to master branch, last one 6 years ago
362
1.9k
unknown
62
Geometry Processing Library for Python
Created 2015-06-06
2,064 commits to main branch, last one 4 years ago
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
Created 2019-05-08
387 commits to master branch, last one 4 months ago
206
1.0k
mit
42
A lean C++ library for working with point cloud data
Created 2017-05-03
841 commits to master branch, last one about a year ago
197
732
other
35
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
Created 2015-09-01
285 commits to master branch, last one 3 months ago
Hull, Delaunay and Voronoi algorithms in Unity
Created 2017-06-21
13 commits to master branch, last one 2 years ago
Voronoi / Delaunay tessellations on the sphere
Created 2016-09-07
163 commits to main branch, last one about a month ago
Scalable symbolic-numeric set computations in Julia
Created 2017-10-03
6,012 commits to master branch, last one 18 days ago
Polyhedral Computation Interface
Created 2016-02-25
802 commits to master branch, last one 2 months ago
A JS library to find the convex hull of a finite set of 3d points
Created 2015-02-25
130 commits to master branch, last one 3 months ago
A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes
Created 2018-07-18
71 commits to master branch, last one 2 years ago
An evaluation framework for machine learning models simulating high-throughput materials discovery.
Created 2022-06-20
390 commits to main branch, last one a day ago
Convex hull of given 3D points
Created 2017-08-01
22 commits to master branch, last one 3 years ago
8
71
unknown
8
Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
Created 2014-11-14
195 commits to master branch, last one 2 years ago
11
71
bsd-3-clause
5
Simplexes with Minimum Volume Enclosing Polynomial Curves
Created 2020-08-10
203 commits to master branch, last one 9 months ago
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Created 2017-03-12
53 commits to master branch, last one 6 years ago
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
Created 2023-05-30
353 commits to main branch, last one 3 years ago