Improved Updating of Euclidean Distance Maps and Voronoi Diagrams

This paper presents novel, highly efficient approaches for updating Euclidean distance maps and Voronoi diagrams represented on grid maps. Our methods employ a dynamic variant of the brushfire algorithm to update only those cells that are actually affected by changes in the environment. In experiments in different environments we show that our update strategies for distance maps and Voronoi diagrams require substantially fewer cell visits and significantly less computation time compared to previous approaches. Furthermore, the dynamic Voronoi diagram also improves on previous work by correctly dealing with non-convex obstacles such as building walls. We also present a dynamic variant of a skeletonization-based approach to Voronoi diagrams that is especially robust to noise. All of our algorithms consider actual Euclidean distances rather than grid steps. An open source implementation is available online.

  author = {Boris Lau and Christoph Sprunk and Wolfram Burgard},
  title = {Improved Updating of {E}uclidean Distance Maps and {V}oronoi Diagrams},
  booktitle = {Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)},
  year = {2010},
  address = {Taipei, Taiwan},
  pages = {281--286},
  doi = {10.1109/IROS.2010.5650794}
Powered by bibtexbrowser
Back to Publications