Talk:Relaxed k-d tree
Latest comment: 3 months ago by 31.222.81.237 in topic Relaxed K-dt trees
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
Relaxed K-dt trees
editThe first author of the first paper on relaxed k-d trees, A. Duch, discusses a new variant of k-d trees with rebalancing in the paper [Partial Match Queries in Relaxed K-dt trees](https://epubs.siam.org/doi/10.1137/1.9781611974775.13). It would be interesting to add a section about this variant, but maybe a simple mention would suffice (because they are based on the W. Cunto, G. Lau, and Ph. Flajolet's k-dt tree data structure from the paper [Analysis of kdt-trees: kd-trees improved by local reorganisations](https://link.springer.com/chapter/10.1007/3-540-51542-9_4). 31.222.81.237 (talk) 18:00, 20 April 2024 (UTC)