85 packages tagged with “distance”
One of the fastest Levenshtein distance packages on NuGet. Supports .NET Framework and .NET. Levenshtein calculates the shortest possible distance between two strings. Producing a count of the number of insertions, deletions and substitutions to make one string into another.
Calculates the Levenshtein distance between two strings. A count of the number of insertions, deletions and substitutions to make one string into another.
A C# class library that will calculate distance and cardinal direction between two sets of coordinates and provides the lat/long boundaries around an origin coordinate allowing for simple SQL or LINQ selection of locations within the given radius.
A .NET port of java-string-similarity.
Library for working with GPS.
A quick and memory efficient Levenshtein Distance calculator for .NET
CoordinateSharp is a high-performance, lightweight .NET library for working with geographical coordinates. Effortlessly convert coordinates, compute distances, and calculate location-based solar, lunar, and magnetic data — all with minimal code.
Google Places, Maps, Roads, Search and Translate. Requests and Responses are complete with Google api documentation and references.
A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. Based upon F23.StringSimilarity
HCSR04 digital ultrasonic distance sensor
Levenshtypo is a high-performance fuzzy string matcher for .NET. It lets you perform typo-tolerant lookups on large string datasets using a fast Trie + Levenshtein Automaton approach. Ideal for search boxes, spell-checking, command matchers, and voice/OCR normalization. Supports: - Levenshtein and Restricted Edit distances - Efficient Trie indexing - Raw Levenshtein Automaton generation Blazing fast. Alloc-friendly. Plug-and-play.
Vl53l0x I2C time of flight ranging distance sensor
MaxBotix I2C, analog and serial ultrasonic distance sensors
Calculate distance between two string by levenshtein distance algorithm
A collections of different calculators and conversions like gravity of beer calculated based on temperature
Me007ys serial ultrasonic distance sensor
Fuzzy search library for finding strings in strings. Inspired by and attempts to be somewhat compatible with fuzzysearch for python https://github.com/taleinat/fuzzysearch
Library for working with measurements.
Centrifuge Game Support Library for Distance mod development
A google map api wrapper for .Net . You can use Directions and Distance Matrix Api using this package
A02yyuw serial ultrasonic distance sensor
Core lib for basic location services operations like geocoding, reverse geocoding, routing and distance.
A utility library for comparing strings via the Dice Coefficient algorithm
[4.0, RT8, SL5, WP8.x] This lib adds some useful extension method to strings and IEnumerable<string> like: MakeAnagram, IsAnagramOf, ContainsAnagramOf, FindAnagramsFor, LevenshteinDistanceFrom, OrderByLevenshteinDistanceFrom q: info@antonioesposito.it
GoogleMaps lib for basic location services operations like geocoding, reverse geocoding, routing and distance.
A utility library for comparing strings via the Levenshtein Distance algorithm
A utility library for comparing strings via the Hamming Distance algorithm
This package contains geo-location representing data structures as well as some APIs for calculating distances between geo-locations
Provides a model for distance in the same style as TimeSpan does for time.
Comprehensive geographic coordinate calculation and clustering utilities for .NET Core applications. Provides distance calculations using Haversine and Vincenty formulas, coordinate validation, bounding box operations, point-in-polygon detection, and advanced clustering algorithms. Features include bearing calculations, midpoint determination, coordinate formatting (DMS, decimal degrees), geofencing capabilities, and K-means clustering for location grouping.