Finding Rooms on Probabilistic Quadtrees

Abstract

Probabilistic quadtrees are a recently developed concept for compact storage of probabilistic occupancy data. In this paper, we introduce a new method for fmding high-level regions ("rooms") on a probabilistic quadtree, exploiting features like its underlying neighborhood graph and binary flags.