ubilabs / kd-tree-javascriptLinks
JavaScript k-d Tree Implementation
☆654Updated 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.☆588Updated 9 months ago
- A static kdtree data structure☆310Updated 4 years ago
- A fast static index for 2D points☆678Updated 3 months ago
- k-nearest neighbors search (KNN) for RBush☆225Updated last year
- 2D constrained Delaunay triangulation☆257Updated 6 years ago
- Two-dimensional recursive spatial subdivision.☆234Updated 2 years ago
- Turns a text string into a 2D poly line☆317Updated last year
- Vector, matrix and geometry math JavaScript☆1,159Updated 6 years ago
- 📈 Multidimensional arrays for JavaScript☆1,239Updated 3 years ago
- Polygon tesselation library, ported from SGI's GLU implementation to JavaScript.☆303Updated 9 years ago
- Fast Delaunay Triangulation in JavaScript.☆780Updated 8 years ago
- Greiner-Hormann polygon clipping algorithm. Does AND, OR, XOR. Plays nicely with Leaflet. Handles non-convex polygons and multiple clippi…☆244Updated 2 years ago
- Density Based Clustering in JavaScript☆226Updated 6 years ago
- The smallest and simplest priority queue in JavaScript.☆458Updated last year
- Easy to use robust Delaunay triangulation☆160Updated 11 years ago
- Small lib for polygon offsetting(margin/padding)☆261Updated 2 years ago
- A 2D constrained Delaunay triangulation library☆338Updated 7 years ago
- Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, uni…☆749Updated 3 months ago
- A JavaScript 2D vector class with methods for common vector operations☆842Updated 2 years ago
- Compute contour polygons using marching squares.☆516Updated 11 months ago
- Turn arrays into smooth functions.☆528Updated 4 years ago
- (sparse + dynamic) 3D spatial representation structure for fast searches☆226Updated 4 years ago
- Compute the Voronoi diagram of a set of two-dimensional points.☆251Updated 6 years ago
- A very fast 2D concave hull algorithm in JavaScript☆703Updated 3 months ago
- Fast robust predicates for computational geometry in JavaScript☆323Updated 3 weeks ago
- Exactly test if a point is inside, outside or on the boundary of a polygon☆249Updated 2 years ago
- lines expanded in a vertex shader☆247Updated 4 years ago
- A library of intersection algorithms covering all SVG shape types☆359Updated last year
- Clipper Abstraction (simplified API)☆132Updated 2 years ago
- A very fast JavaScript polyline and polygon clipping library☆182Updated 3 months ago