This component provides a flexible way to apply geospatial filtering to search results.
Minimal and efficient cross-platform file watching library
Write files in an atomic fashion w/configurable ownership
Measures the straight-line distance between two points, like cities or landmarks.
Fastest Levenshtein distance implementation in JS.
Read and write files atomically and reliably.
Calculates the distance along a rhumb line between two points.
Calculate the influence or weight of points over an area based on their distances.
Match human-quality input to potential matches by edit distance.
Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.
Measure the difference between two strings using the Levenshtein distance algorithm
Calculates the distance between a given point and the nearest point on a line.
A string similarity function using the Jaro-Winkler distance metric.
Compute the euclidean distance between two vectors
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Levenshtein edit distance
Distance and similarity functions to compare vectors
turf destination module
Browser-side SDF font generator
Regex template tag with extended syntax, context-aware interpolation, and always-on best practices
A JS library for finding optimal label position inside a polygon
Estimate points on a bezier curve or a set of connexted bezier curves
[](https://npm.im/@dnd-kit/geometry)
A library implementing different string similarity