Probabilistic quadtrees are a recently developed concept for compact storage of probabilistic occupancy data. In this paper, we introduce a new method for finding high-level regions ("rooms") on a probabilistic quadtree, exploiting features like its underlying neighborhood graph and binary flags.
CITATION STYLE
Gassuli, G. P., Kraetzschmar, G. K., & Palm, G. (2006). Finding rooms on probabilistic quadtrees. In Informatik aktuell (pp. 219–226). https://doi.org/10.1007/3-540-30292-1_28
Mendeley helps you to discover research relevant for your work.