/* * Software License Agreement (BSD License) * * Copyright (c) 2010, 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. * */ #ifndef PCL_SURFACE_IMPL_MARCHING_CUBES_HOPPE_H_ #define PCL_SURFACE_IMPL_MARCHING_CUBES_HOPPE_H_ #include ////////////////////////////////////////////////////////////////////////////////////////////// template pcl::MarchingCubesHoppe::~MarchingCubesHoppe () { } ////////////////////////////////////////////////////////////////////////////////////////////// template void pcl::MarchingCubesHoppe::voxelizeData () { const bool is_far_ignored = dist_ignore_ > 0.0f; for (int x = 0; x < res_x_; ++x) { const int y_start = x * res_y_ * res_z_; for (int y = 0; y < res_y_; ++y) { const int z_start = y_start + y * res_z_; for (int z = 0; z < res_z_; ++z) { pcl::Indices nn_indices (1, 0); std::vector nn_sqr_dists (1, 0.0f); const Eigen::Vector3f point = (lower_boundary_ + size_voxel_ * Eigen::Array3f (x, y, z)).matrix (); PointNT p; p.getVector3fMap () = point; tree_->nearestKSearch (p, 1, nn_indices, nn_sqr_dists); if (!is_far_ignored || nn_sqr_dists[0] < dist_ignore_) { const Eigen::Vector3f normal = (*input_)[nn_indices[0]].getNormalVector3fMap (); if (!std::isnan (normal (0)) && normal.norm () > 0.5f) grid_[z_start + z] = normal.dot ( point - (*input_)[nn_indices[0]].getVector3fMap ()); } } } } } #define PCL_INSTANTIATE_MarchingCubesHoppe(T) template class PCL_EXPORTS pcl::MarchingCubesHoppe; #endif // PCL_SURFACE_IMPL_MARCHING_CUBES_HOPPE_H_