Golang implementation of the quadtree algorithm. Includes removal, update and knearest search.
Godoc https://godoc.org/github.com/asim/quadtree
Create a quadtree fitting the world geographic bounds (from [-90,-180] to [90,180])
centerPoint := quadtree.NewPoint(0.0, 0.0, nil)
halfPoint := quadtree.NewPoint(90.0, 180.0, nil)
boundingBox := quadtree.NewAABB(centerPoint, halfPoint)
qtree := quadtree.New(boundingBox, 0, nil)Insert a point into the tree
point := quadtree.NewPoint(52.5200, 13.4050, "Berlin")
if !qtree.Insert(point) {
log.Fatal("Failed to insert the point")
}Find the k-nearest points
center := quadtree.NewPoint(lat, lng, nil)
distance := 10000 /* Distance to the center point in meters */
bounds := quadtree.NewAABB(center, center.HalfPoint(distance))
maxPoints := 10
for _, point := range qtree.KNearest(bounds, maxPoints, nil) {
log.Printf("Found point: %s\n", point.Data().(string))
}