orx-quadtree
An extension for creating a Quadtree for points. A quadtree is a spatial partioning tree structure meant to provide fast spatial queries such as nearest points within a range.
Example
val box = Rectangle.fromCenter(Vector2(400.0), 750.0)
val quadTree = Quadtree<Vector2>(box) { it }
for (point in points) {
quadTree.insert(point)
}
val nearestQuery = quadTree.nearest(points[4], 20.0)
Author
Ricardo Matias / @ricardomatias
Demos
DemoQuadTree01
DemoQuadTree02
