2d tree for efficient range search and nearest point wuery
-
Updated
Nov 3, 2019 - Java
2d tree for efficient range search and nearest point wuery
Create a symbol table data type whose keys are two-dimensional points. Use a 2d-tree to support efficient range search and nearest neighbor search.
2D Spatial Tree with Query Search
storing and processing Pittsburgh 1990s Crime Data using a 2D tree
Self-balancing 2D Interval Tree using an augmented AVL Tree for efficient 2D rectangle queries for overlapping regions, with optional visualization of the tree and intervals.
To associate your repository with the 2d-tree topic, visit your repo's landing page and select "manage topics."