5 results found Sort:
- Filter by Primary Language:
- C (2)
- C# (1)
- C++ (1)
- TypeScript (1)
- +
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh ...
bezier
unity3d
voronoi
quickhull
convex-hull
open-source
ear-clipping
jarvis-march
gift-wrapping
interpolation
intersections
triangulation
computer-science
marching-squares
polygon-clipping
mesh-simplification
software-engineering
computational-geometry
delaunay-triangulation
constrained-delaunay-triangulation
Created
2019-05-08
387 commits to master branch, last one 6 months ago
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 5 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 4 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
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