octree_pointcloud_voxelcentroid.h

Go to the documentation of this file.

/*
 * Software License Agreement (BSD License)
 *
 *  Point Cloud Library (PCL) - www.pointclouds.org
 *  Copyright (c) 2010-2011, Willow Garage, Inc.
 *
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *
 *   * Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above
 *     copyright notice, this list of conditions and the following
 *     disclaimer in the documentation and/or other materials provided
 *     with the distribution.
 *   * Neither the name of Willow Garage, Inc. nor the names of its
 *     contributors may be used to endorse or promote products derived
 *     from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
 *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 *  POSSIBILITY OF SUCH DAMAGE.
 *
 * $Id: octree_pointcloud_voxelcentroid.h 6119 2012-07-03 18:50:04Z aichim $
 */

#ifndef OCTREE_VOXELCENTROID_H
#define OCTREE_VOXELCENTROID_H

#include "octree_pointcloud.h"

#include "octree_base.h"
#include "octree2buf_base.h"

namespace pcl
{
  namespace octree
  {



    template<typename PointT, typename LeafT = OctreeContainerDataTVector<int> , typename BranchT = OctreeContainerEmpty<int> >
      class OctreePointCloudVoxelCentroid : public OctreePointCloud<PointT, LeafT, BranchT>
      {

      public:
        // public typedefs for single/double buffering

        // Eigen aligned allocator
        typedef typename OctreePointCloud<PointT, LeafT, BranchT>::AlignedPointTVector AlignedPointTVector;

        OctreePointCloudVoxelCentroid (const double resolution_arg) :
          OctreePointCloud<PointT, LeafT, BranchT> (resolution_arg)
        {
        }

        virtual
        ~OctreePointCloudVoxelCentroid ()
        {
        }

        unsigned int
        getVoxelCentroids (AlignedPointTVector &voxelCentroidList_arg)
        {

          size_t i;
          unsigned int pointCounter;
          OctreeKey keyC, keyP;
          PointT meanPoint;
          PointT idxPoint;

          std::vector<int> indicesVector;

          voxelCentroidList_arg.clear();
          voxelCentroidList_arg.reserve(this->leafCount_);

          // serialize leafs - this returns a list of point indices. Points indices from the same voxel are locates next to each other within this vector.
          this->serializeLeafs (indicesVector);

          // initializing
          keyP.x = keyP.y = keyP.z = std::numeric_limits<unsigned int>::max ();
          meanPoint.x = meanPoint.y = meanPoint.z = 0.0;
          pointCounter = 0;

          // iterate over all point indices
          for (i = 0; i < indicesVector.size (); i++)
          {
            idxPoint = this->input_->points[indicesVector[i]];

            // get octree key for point (key specifies octree voxel)
            this->genOctreeKeyforPoint (idxPoint, keyC);

            if (keyC == keyP)
            {
              // key addresses same voxel - add point
              meanPoint.x += idxPoint.x;
              meanPoint.y += idxPoint.y;
              meanPoint.z += idxPoint.z;

              pointCounter++;
            }
            else
            {
              // voxel key did change - calculate centroid and push it to result vector
              if (pointCounter > 0)
              {
                meanPoint.x /= static_cast<float> (pointCounter);
                meanPoint.y /= static_cast<float> (pointCounter);
                meanPoint.z /= static_cast<float> (pointCounter);

                voxelCentroidList_arg.push_back (meanPoint);
              }

              // reset centroid to current input point
              meanPoint.x = idxPoint.x;
              meanPoint.y = idxPoint.y;
              meanPoint.z = idxPoint.z;
              pointCounter = 1;

              keyP = keyC;
            }
          }

          // push last centroid to result vector if necessary
          if (pointCounter > 0)
          {
            meanPoint.x /= static_cast<float> (pointCounter);
            meanPoint.y /= static_cast<float> (pointCounter);
            meanPoint.z /= static_cast<float> (pointCounter);

            voxelCentroidList_arg.push_back (meanPoint);
          }

          // return size of centroid vector
          return (static_cast<unsigned int> (voxelCentroidList_arg.size ()));
        }

        bool
        getVoxelCentroidAtPoint (const PointT& point_arg, PointT& voxelCentroid_arg)
        {

          size_t i;
          unsigned int pointCounter;
          std::vector<int> indicesVector;
          PointT meanPoint;
          PointT idxPoint;

          bool bResult;

          // get all point indixes from voxel at point point_arg
          bResult = this->voxelSearch (point_arg, indicesVector);

          if (bResult)
          {
            meanPoint.x = meanPoint.y = meanPoint.z = 0.0;
            pointCounter = 0;

            // iterate over all point indices
            for (i = 0; i < indicesVector.size (); i++)
            {
              idxPoint = this->input_->points[indicesVector[i]];

              meanPoint.x += idxPoint.x;
              meanPoint.y += idxPoint.y;
              meanPoint.z += idxPoint.z;

              pointCounter++;
            }

            // calculate centroid
            voxelCentroid_arg.x = meanPoint.x / static_cast<float> (pointCounter);
            voxelCentroid_arg.y = meanPoint.y / static_cast<float> (pointCounter);
            voxelCentroid_arg.z = meanPoint.z / static_cast<float> (pointCounter);
          }

          return (bResult);
        }

        inline bool
        getVoxelCentroidAtPoint (const int& pointIdx_arg, PointT& voxelCentroid_arg)
        {

          // retrieve point from input cloud
          const PointT& point = this->input_->points[pointIdx_arg];

          // get centroid at point
          return this->getVoxelCentroidAtPoint (point, voxelCentroid_arg);

        }

      };

  }

}

#define PCL_INSTANTIATE_OctreePointCloudVoxelCentroid(T) template class PCL_EXPORTS pcl::octree::OctreePointCloudVoxelCentroid<T>;

#endif