This is java class for spatial indexing large set of 2D rectangles. Rectangles are inserted into RTree with integer id and coordinates. Query function return all rectangles intersecting or overlapping given rectangle. See Wiki for API help.
-
Notifications
You must be signed in to change notification settings - Fork 1
R-Tree class for spatial indexing of rectangles, intended for very large data sets in memory.
License
hadmir/LargeRtree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
R-Tree class for spatial indexing of rectangles, intended for very large data sets in memory.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published