kd_tree vs haversine

kd_tree

Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors" (by geocrystal)

Source Code

Suggest alternative

Edit details

haversine

Crystal implementation of the Haversine formula to calculate distances between two points given their latitudes and longitudes (by geocrystal)

Algorithms and Data structures Crystal haversine-formula

Source Code

Suggest alternative

Edit details

Our great sponsors

InfluxDB - Power Real-Time Data Analytics at Scale

WorkOS - The modern identity platform for B2B SaaS

SaaSHub - Software Alternatives and Reviews

Our great sponsors

kd_tree		haversine
	Project
-	Mentions	-
16	Stars	15
-	Growth	-
0.0	Activity	0.0
about 3 years ago	Latest Commit	over 1 year ago
Crystal	Language	Crystal
MIT License	License	MIT License

The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

kd_tree

Posts with mentions or reviews of kd_tree. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning kd_tree yet.
Tracking mentions began in Dec 2020.

haversine

Posts with mentions or reviews of haversine. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning haversine yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing kd_tree and haversine you can also consider the following projects:

murmur3 - Crystal implementation of Murmur3 hash algorithm used by Cassandra

aho_corasick - aho_corasick for crystal-lang

graphlb - graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang.

splay_tree_map.cr - This is a Crystal implementation of a Splay Tree; which is a type of binary search tree that is semi-balanced and that tends to self-optimize so that the most accessed items are the fastest to retrieve.

multiset.cr - Multiset (bag) implementation in Crystal

crystalg - Algorithm Library for Crystal

blurhash.cr - A pure Crystal implementation of BlurHash algorithm

bisect - Library for maintaining sorted Arrays

csuuid.cr - This is a small UUID library that implements a chronologically sortable UUID.

s2_cells - maps latitude and longitude to S2 Cells https://s2geometry.io/