https://github.com/virtuald/r-star-tree
A relatively simple implementation of the R* Tree data structure for C++
https://github.com/virtuald/r-star-tree
Last synced: about 1 year ago
JSON representation
A relatively simple implementation of the R* Tree data structure for C++
- Host: GitHub
- URL: https://github.com/virtuald/r-star-tree
- Owner: virtuald
- License: lgpl-2.1
- Created: 2016-07-03T15:40:19.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2023-01-10T18:10:52.000Z (over 3 years ago)
- Last Synced: 2025-02-25T09:02:01.210Z (over 1 year ago)
- Language: C++
- Homepage: http://www.virtualroadside.com/blog/index.php/2008/10/04/r-tree-implementation-for-cpp/
- Size: 30.3 KB
- Stars: 48
- Watchers: 6
- Forks: 17
- Open Issues: 3
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
R* Tree for C++
===============
In 2008 I created this R* Tree implementation in C++. My goal for this
implementation was as follows:
* Simple API – Most existing implementations I’ve seen are far from simple
* Generic enough to use with most types, with low overhead
* N dimensions for bounding boxes
* Take advantage of modern C++ features to get decent performance
This is a header-only implementation of an R tree with an R* index, and makes
heavy use of templates, STL, and STL-style functors; but it should work in any
relatively modern C++ compiler. To do searching for nodes, this implementation
uses the Visitor pattern via functors — there are examples and documentation in
RStarVisitor.h.
Maintenance
===========
I do not use or update this code anymore, but I welcome pull requests.
License
=======
GNU Lesser Public License v2.1
Author
======
Dustin Spicuzza (dustin@virtualroadside.com)