/usr/include/pcl-1.7/pcl/features/boundary.h is in libpcl-dev 1.7.2-7.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 | /*
* Software License Agreement (BSD License)
*
* Point Cloud Library (PCL) - www.pointclouds.org
* Copyright (c) 2010-2011, Willow Garage, Inc.
* Copyright (c) 2012-, Open Perception, 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 the copyright holder(s) 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$
*
*/
#ifndef PCL_BOUNDARY_H_
#define PCL_BOUNDARY_H_
#include <pcl/features/eigen.h>
#include <pcl/features/feature.h>
namespace pcl
{
/** \brief BoundaryEstimation estimates whether a set of points is lying on surface boundaries using an angle
* criterion. The code makes use of the estimated surface normals at each point in the input dataset.
*
* Here's an example for estimating boundary points for a PointXYZ point cloud:
* \code
* pcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);
* // fill in the cloud data here
*
* pcl::PointCloud<pcl::Normal>::Ptr normals (new pcl::PointCloud<pcl::Normal>);
* // estimate normals and fill in \a normals
*
* pcl::PointCloud<pcl::Boundary> boundaries;
* pcl::BoundaryEstimation<pcl::PointXYZ, pcl::Normal, pcl::Boundary> est;
* est.setInputCloud (cloud);
* est.setInputNormals (normals);
* est.setRadiusSearch (0.02); // 2cm radius
* est.setSearchMethod (typename pcl::search::KdTree<PointXYZ>::Ptr (new pcl::search::KdTree<PointXYZ>)
* est.compute (boundaries);
* \endcode
*
* \attention
* The convention for Boundary features is:
* - if a query point's nearest neighbors cannot be estimated, the boundary feature will be set to NaN
* (not a number)
* - it is impossible to estimate a boundary property for a point that
* doesn't have finite 3D coordinates. Therefore, any point that contains
* NaN data on x, y, or z, will have its boundary feature property set to NaN.
*
* \author Radu B. Rusu
* \ingroup features
*/
template <typename PointInT, typename PointNT, typename PointOutT>
class BoundaryEstimation: public FeatureFromNormals<PointInT, PointNT, PointOutT>
{
public:
typedef boost::shared_ptr<BoundaryEstimation<PointInT, PointNT, PointOutT> > Ptr;
typedef boost::shared_ptr<const BoundaryEstimation<PointInT, PointNT, PointOutT> > ConstPtr;
using Feature<PointInT, PointOutT>::feature_name_;
using Feature<PointInT, PointOutT>::getClassName;
using Feature<PointInT, PointOutT>::input_;
using Feature<PointInT, PointOutT>::indices_;
using Feature<PointInT, PointOutT>::k_;
using Feature<PointInT, PointOutT>::tree_;
using Feature<PointInT, PointOutT>::search_radius_;
using Feature<PointInT, PointOutT>::search_parameter_;
using Feature<PointInT, PointOutT>::surface_;
using FeatureFromNormals<PointInT, PointNT, PointOutT>::normals_;
typedef typename Feature<PointInT, PointOutT>::PointCloudOut PointCloudOut;
public:
/** \brief Empty constructor.
* The angular threshold \a angle_threshold_ is set to M_PI / 2.0
*/
BoundaryEstimation () : angle_threshold_ (static_cast<float> (M_PI) / 2.0f)
{
feature_name_ = "BoundaryEstimation";
};
/** \brief Check whether a point is a boundary point in a planar patch of projected points given by indices.
* \note A coordinate system u-v-n must be computed a-priori using \a getCoordinateSystemOnPlane
* \param[in] cloud a pointer to the input point cloud
* \param[in] q_idx the index of the query point in \a cloud
* \param[in] indices the estimated point neighbors of the query point
* \param[in] u the u direction
* \param[in] v the v direction
* \param[in] angle_threshold the threshold angle (default \f$\pi / 2.0\f$)
*/
bool
isBoundaryPoint (const pcl::PointCloud<PointInT> &cloud,
int q_idx, const std::vector<int> &indices,
const Eigen::Vector4f &u, const Eigen::Vector4f &v, const float angle_threshold);
/** \brief Check whether a point is a boundary point in a planar patch of projected points given by indices.
* \note A coordinate system u-v-n must be computed a-priori using \a getCoordinateSystemOnPlane
* \param[in] cloud a pointer to the input point cloud
* \param[in] q_point a pointer to the querry point
* \param[in] indices the estimated point neighbors of the query point
* \param[in] u the u direction
* \param[in] v the v direction
* \param[in] angle_threshold the threshold angle (default \f$\pi / 2.0\f$)
*/
bool
isBoundaryPoint (const pcl::PointCloud<PointInT> &cloud,
const PointInT &q_point,
const std::vector<int> &indices,
const Eigen::Vector4f &u, const Eigen::Vector4f &v, const float angle_threshold);
/** \brief Set the decision boundary (angle threshold) that marks points as boundary or regular.
* (default \f$\pi / 2.0\f$)
* \param[in] angle the angle threshold
*/
inline void
setAngleThreshold (float angle)
{
angle_threshold_ = angle;
}
/** \brief Get the decision boundary (angle threshold) as set by the user. */
inline float
getAngleThreshold ()
{
return (angle_threshold_);
}
/** \brief Get a u-v-n coordinate system that lies on a plane defined by its normal
* \param[in] p_coeff the plane coefficients (containing the plane normal)
* \param[out] u the resultant u direction
* \param[out] v the resultant v direction
*/
inline void
getCoordinateSystemOnPlane (const PointNT &p_coeff,
Eigen::Vector4f &u, Eigen::Vector4f &v)
{
pcl::Vector4fMapConst p_coeff_v = p_coeff.getNormalVector4fMap ();
v = p_coeff_v.unitOrthogonal ();
u = p_coeff_v.cross3 (v);
}
protected:
/** \brief Estimate whether a set of points is lying on surface boundaries using an angle criterion for all points
* given in <setInputCloud (), setIndices ()> using the surface in setSearchSurface () and the spatial locator in
* setSearchMethod ()
* \param[out] output the resultant point cloud model dataset that contains boundary point estimates
*/
void
computeFeature (PointCloudOut &output);
/** \brief The decision boundary (angle threshold) that marks points as boundary or regular. (default \f$\pi / 2.0\f$) */
float angle_threshold_;
};
}
#ifdef PCL_NO_PRECOMPILE
#include <pcl/features/impl/boundary.hpp>
#endif
#endif //#ifndef PCL_BOUNDARY_H_
|