ubilabs / kd-tree-javascriptLinks
JavaScript k-d Tree Implementation
☆652Updated last year
Alternatives and similar repositories for kd-tree-javascript
Users that are interested in kd-tree-javascript are comparing it to the libraries listed below
Sorting:
- This repository is deprecated and no longer maintained.☆591Updated 7 months ago
- 2D constrained Delaunay triangulation☆256Updated 6 years ago
- A fast static index for 2D points☆673Updated last month
- Vector, matrix and geometry math JavaScript☆1,163Updated 6 years ago
- A static kdtree data structure☆310Updated 4 years ago
- k-nearest neighbors search (KNN) for RBush☆225Updated last year
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆302Updated 9 years ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆243Updated 2 years ago
- The smallest and simplest priority queue in JavaScript.☆460Updated last year
- Two-dimensional recursive spatial subdivision.☆233Updated last year
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆742Updated 2 months ago
- A library of intersection algorithms covering all SVG shape types☆355Updated last year
- A 2D constrained Delaunay triangulation library☆337Updated 6 years ago
- Compute the Voronoi diagram of a set of two-dimensional points.☆251Updated 6 years ago
- Fast Delaunay Triangulation in JavaScript.☆780Updated 8 years ago
- 📈 Multidimensional arrays for JavaScript☆1,237Updated 3 years ago
- Turns a text string into a 2D poly line☆317Updated last year
- Turn arrays into smooth functions.☆527Updated 3 years ago
- Small lib for polygon offsetting(margin/padding)☆261Updated 2 years ago
- lines expanded in a vertex shader☆247Updated 4 years ago
- A JavaScript 2D vector class with methods for common vector operations☆841Updated 2 years ago
- Apply boolean polygon clipping operations (union, intersection, difference, xor) to your Polygons & MultiPolygons.☆595Updated last year
- Fast robust predicates for computational geometry in JavaScript☆320Updated last year
- A Javascript implementation of Fortune's algorithm to compute Voronoi cells☆1,052Updated 2 years ago
- Boolean operations on polygons (union, intersection, difference, xor)☆621Updated last year
- Easy to use robust Delaunay triangulation☆160Updated 11 years ago
- (sparse + dynamic) 3D spatial representation structure for fast searches☆226Updated 3 years ago
- Compute contour polygons using marching squares.☆513Updated 10 months ago
- A very fast JavaScript polyline and polygon clipping library☆182Updated 2 months ago
- A 3D/WebGL math library☆420Updated last year