Finding the nearest poitns surroundings a coordinate
Finds the nearest point from a FeatureCollection of Features with Point geometries to a given point.
Calculates an index based the average distances between points in the dataset, thereby providing inference as to whether the data is clustered, dispersed, or randomly distributed within the study area.
Returns the closest point, of a collection of points, to a line.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
A geographic extension for [KDBush](https://github.com/mourner/kdbush), the fastest static spatial index for points in JavaScript.
Find the nearest point to a sample point
Estimate points on a bezier curve or a set of connexted bezier curves
A basic but super fast JavaScript implementation of the k-dimensional tree data structure.
Finds the nearest point based on a delaunay diagram
Find the nearest value of a discrete periodic function, given a point.
Estimate points on a SVG path
Convert a series of points to a monotone cubic spline
Match human-quality input to potential matches by edit distance.
Fast robust predicates for computational geometry
Draw perfect pressure-sensitive freehand strokes.
Finds the nearest point on a line to a given point
Node.js bindings for Hnswlib
Operations for two-dimensional polygons.
Find the nearest file with a given name
A partial port of the Apache Commons Math Interpolation package, including Akima cubic spline interpolation and LOESS/LOWESS local regression.
Fill a polygon with lines
search for k nearest neighbors on a sphere
Takes a set of points and creates a Triangulated Irregular Network.
Scientific visualization widgets for ratatui — matplotlib for the terminal
Precision time interpretation and format conversion for IRIG 106 telemetry data.
Distance queries for parametric curves in 2D and 3D (nearest point, unsigned distance, early-out with speed bounds).
High-performance append-only plotting for GPUI applications.
A kdtree is a data structure that makes it possible to quickly solve the nearest neighbor problem. This is a native 2d kdtree suitable for production use with millions of points.
Anngler is an approximate nearest neighbor search for points in n-dimensional space that are close in terms of cosine distance to a given point. The gem is built with serverless architecture in mind with Redis but it also offers a local in-memory storage.
Gem parses SRTM data and for given latitude/longitude returns the elevation for that point, or nearest interpolated.
RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points. It is intended to function as a complemenet to GeoRuby. These structures can be used to compute a nearest-neighbor graph for a set of points. This graph can in turn be used for proximity-based clustering of the input points.
RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points. It is intended to function as a complemenet to GeoRuby. These structures can be used to compute a nearest-neighbor graph for a set of points. This graph can in turn be used for proximity-based clustering of the input points.
neartree is a Ruby library binding to the NearTree C library for storing point/value pairs in an R-Tree structure and searching it for the nearest neighbour for any given point.
RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points. It is intended to function as a complemenet to GeoRuby. These structures can be used to compute a nearest-neighbor graph for a set of points. This graph can in turn be used for proximity-based clustering of the input points.
No description provided.
No description provided.