Only released in EOL distros:
Package Summary
This package contains algorithms that can compute the Euclidean Distance Transform (EDT) of a 3-D voxel grid. The input to these algorithms is an array of points (which could represent the positions of obstacles in the world). The EDT provides a voxel grid in which in which each cell contains the distance to the closest obstacle. The VoxelGrid class can also be used as a generic, templatized container for a discretized 3-D voxel grid.
- Author: Mrinal Kalakrishnan / mail@mrinal.net
 - License: BSD
 - Repository: wg-ros-pkg
 - Source: svn https://code.ros.org/svn/wg-ros-pkg/stacks/motion_planning_common/tags/motion_planning_common-0.3.6
 
Package Summary
This package contains algorithms that can compute the Euclidean Distance Transform (EDT) of a 3-D voxel grid. The input to these algorithms is an array of points (which could represent the positions of obstacles in the world). The EDT provides a voxel grid in which in which each cell contains the distance to the closest obstacle. The VoxelGrid class can also be used as a generic, templatized container for a discretized 3-D voxel grid.
- Author: Mrinal Kalakrishnan / mail@mrinal.net
 - License: BSD
 - Source: hg https://kforge.ros.org/armnavigation/experimental (branch: electric_patches)
 
Package Summary
This package contains algorithms that can compute the Euclidean Distance Transform (EDT) of a 3-D voxel grid. The input to these algorithms is an array of points (which could represent the positions of obstacles in the world). The EDT provides a voxel grid in which in which each cell contains the distance to the closest obstacle. The VoxelGrid class can also be used as a generic, templatized container for a discretized 3-D voxel grid.
- Author: Mrinal Kalakrishnan / mail@mrinal.net
 - License: BSD
 - Source: hg https://kforge.ros.org/armnavigation/experimental (branch: default)
 
Package Summary
This package contains algorithms that can compute the Euclidean Distance Transform (EDT) of a 3-D voxel grid. The input to these algorithms is an array of points (which could represent the positions of obstacles in the world). The EDT provides a voxel grid in which in which each cell contains the distance to the closest obstacle. The VoxelGrid class can also be used as a generic, templatized container for a discretized 3-D voxel grid.
- Author: Mrinal Kalakrishnan / mail@mrinal.net
 - License: BSD
 - Source: hg https://kforge.ros.org/armnavigation/experimental (branch: default)
 
Further details are available in the Code API.
API
- ROS API is UNREVIEWED and UNSTABLE
 - C++ API is UNREVIEWED and UNSTABLE