Build a HD-Tree: An Efficient High-Dimensional Virtual Index Structure Using a Half Decomposition Strategy
$10-30 USD
Closed
Posted about 3 years ago
$10-30 USD
Paid on delivery
HD-tree is an improvement on D-tree indexing method. Both structures combine quadtree-like partitioning using integer shift operations without storing internal nodes, but only leaves. More description is given in the attached pdf document.
Hi there,
I have read your project description and I am confident about your project I can do perfectly. Please leave a message on my chat so we can discuss the budget and deadline of the project.
Thanks.
regard ,
faizan