This project utilizes a KD Tree data structure to efficiently find the nearest city given a pair of longitude and latitude coordinates
-
Updated
Aug 14, 2024 - Go
#
kdtree
Here are 7 public repositories matching this topic...
Very fast static, flat 2D Interval Tree (box overlap) for Go
go
fast
golang
tree
kd-tree
data-structures
index
tree-structure
spatial-index
bbox
kdtree
flat-tree
boxtree
-
Updated
Mar 25, 2022 - Go
Very fast static, flat Interval Tree for Go
go
fast
golang
tree
data-structures
tree-structure
interval-tree
golang-package
kdtree
flat-tree
intree
-
Updated
Mar 25, 2022 - Go
Golang Utilities for Data Analysis
-
Updated
Nov 23, 2018 - Go
A k-d tree implementation in Go.
-
Updated
Apr 9, 2024 - Go
Improve this page
Add a description, image, and links to the kdtree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the kdtree topic, visit your repo's landing page and select "manage topics."