00001 /* 00002 * Software License Agreement (BSD License) 00003 * 00004 * Copyright (c) 2009, Willow Garage, Inc. 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions 00009 * are met: 00010 * 00011 * * Redistributions of source code must retain the above copyright 00012 * notice, this list of conditions and the following disclaimer. 00013 * * Redistributions in binary form must reproduce the above 00014 * copyright notice, this list of conditions and the following 00015 * disclaimer in the documentation and/or other materials provided 00016 * with the distribution. 00017 * * Neither the name of Willow Garage, Inc. nor the names of its 00018 * contributors may be used to endorse or promote products derived 00019 * from this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00022 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00023 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00024 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 00025 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00026 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00027 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00028 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00029 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 00031 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00032 * POSSIBILITY OF SUCH DAMAGE. 00033 * 00034 * $Id: filter.hpp 35834 2011-02-08 06:57:03Z rusu $ 00035 * 00036 */ 00037 00038 #ifndef PCL_FILTERS_IMPL_FILTER_H_ 00039 #define PCL_FILTERS_IMPL_FILTER_H_ 00040 00041 #include "pcl/win32_macros.h" 00042 00044 template <typename PointT> void 00045 pcl::removeNaNFromPointCloud (const pcl::PointCloud<PointT> &cloud_in, pcl::PointCloud<PointT> &cloud_out, 00046 std::vector<int> &index) 00047 { 00048 cloud_out.is_dense = true; // Removing bad points => dense (note: 'dense' doesn't mean 'organized') 00049 // If the clouds are not the same, prepare the output 00050 if (&cloud_in != &cloud_out) 00051 { 00052 cloud_out.header = cloud_in.header; 00053 cloud_out.points.resize (cloud_in.points.size ()); 00054 } 00055 // Reserve enough space for the indices 00056 index.resize (cloud_in.points.size ()); 00057 int j = 0; 00058 00059 // If the data is dense, we don't need to check for NaN 00060 if (cloud_in.is_dense) 00061 { 00062 for (size_t i = 0; i < cloud_out.points.size (); ++i) 00063 { 00064 cloud_out.points[j] = cloud_in.points[i]; 00065 index[j] = i; 00066 j++; 00067 } 00068 } 00069 else 00070 { 00071 for (size_t i = 0; i < cloud_out.points.size (); ++i) 00072 { 00073 if (!pcl_isfinite (cloud_in.points[i].x) || 00074 !pcl_isfinite (cloud_in.points[i].y) || 00075 !pcl_isfinite (cloud_in.points[i].z)) 00076 continue; 00077 cloud_out.points[j] = cloud_in.points[i]; 00078 index[j] = i; 00079 j++; 00080 } 00081 } 00082 // Resize to the correct size 00083 cloud_out.points.resize (j); 00084 index.resize (j); 00085 cloud_out.height = 1; 00086 cloud_out.width = j; 00087 } 00088 00089 #define PCL_INSTANTIATE_removeNanFromPointCloud(T) template void pcl::removeNaNFromPointCloud<T>(const pcl::PointCloud<T>&, pcl::PointCloud<T>&, std::vector<int>&); 00090 00091 #endif // PCL_FILTERS_IMPL_FILTER_H_ 00092