The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
- triangulation
- tessellation
- polygon
- algorithm
47,133 repositories indexed
1–9 of 9 · Most stars
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
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
Qhull development for www.qhull.org -- Qhull 2020.2 (8.1-alpha1) at https://github.com/qhull/qhull/wiki
A C implementation for creating 2D Voronoi/Delauney diagrams
Voronoi / Delaunay tessellations on the sphere
Allocators, I/O streams, math, geometry, image and audio processing for D
Delaunay triangulation for convex polygon
A GDScript port of Delaunator: A fast library for Delaunay triangulation of 2D points.
slick is a simple to use polygon collision library inspired by bump.lua