|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
2D k-d tree implementation for spatial point indexing. More...
Go to the source code of this file.
Classes | |
| class | K2Tree< T > |
| 2D k-d tree for efficient spatial point operations. More... | |
| struct | K2Tree< T >::Node |
| Internal node structure for the k-d tree. More... | |
2D k-d tree implementation for spatial point indexing.
This file provides K2Tree, a 2D specialization of the k-d tree (k-dimensional tree) data structure. It partitions 2D space by alternating between vertical and horizontal splits, enabling efficient nearest neighbor and range queries.
Definition in file tpl_2dtree.H.