A modular geospatial engine written in JavaScript and TypeScript
- javascript
- algorithm
- computational-geometry
- geojson
70,234 visible repositories in the index
1–24 of 32 · Most stars
A modular geospatial engine written in JavaScript and TypeScript
The public CGAL repository, see the README below
Python library for loading and using triangular meshes.
A BVH implementation to speed up raycasting and enable spatial queries against three.js meshes.
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Computational geometry and spatial indexing on the sphere
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
USD BRep is a standalone C++ and Python library for NURBS-based boundary representation (BRep) solid modeling
A .NET GIS solution that is fast and reliable for the .NET platform.
The Polygon Mesh Processing Library
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
Polygonal Surface Reconstruction from Point Clouds (C++ & Python)
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
Robust Tetrahedral Meshing in the Wild.
A library provides spatial data and geometric algorithms
A Rust port of NVIDIA's SMLib B-rep kernel (CAD subset): safe, deterministic, wasm-compatible
A simple script for fracturing polygons. Also adds nice helper functions for polygons like calculateArea, triangulate, getRandomPointsInPolygon, getBoundingRect)
Voronoi / Delaunay tessellations on the sphere
TriWild: Robust Triangulation with Curve Constraints
Simple Features is a pure Go Implementation of the OpenGIS Simple Feature Access Specification
A Geometry library for Elixir that calculates spatial relationships between two geometries
RTree2D is a 2D immutable R-tree for ultra-fast nearest and intersection queries in plane and spherical coordinates