Quad-K-d Trees
From MaRDI portal
Publication:5405088
DOI10.1007/978-3-642-54423-1_64zbMath1405.68097OpenAlexW2289551710MaRDI QIDQ5405088
Salvador Roura, Amalia Duch, Krisztián Németh, Nikolett Bereczky
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_64
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)
Related Items (3)
On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Faster compressed quadtrees
This page was built for publication: Quad-K-d Trees
