go-rquad
State-of-the-art point location and neighbor finding algorithms for region quadtrees, implemented in Go.
What is go-rquad?
Go-rquad is a Go library that provides various implementations of region quadtrees, a data structure that recursively subdivides 2D spaces into rectangular regions. It is designed for efficient spatial queries, such as neighbor finding and point location, making it useful for applications like image processing and variable-resolution data representation (e.g., temperature fields).
Go developers working on spatial data processing, such as those in image analysis, geographic information systems (GIS), or scientific computing, who need efficient quadtree operations.
Developers choose go-rquad for its state-of-the-art implementations, like the Cardinal Neighbor Quadtree offering constant-time O(1) neighbor access and fast point location via the binary branching method, all benchmarked for performance and designed with simplicity in Go.
Overview
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
Use Cases
Best For
- Implementing efficient spatial queries in 2D spaces, such as neighbor finding in image processing workflows.
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
