40 #ifndef PCL_FEATURES_IMPL_NORMAL_3D_OMP_H_
41 #define PCL_FEATURES_IMPL_NORMAL_3D_OMP_H_
46 template <
typename Po
intInT>
void
54 output.
points.resize (indices_->size (), 4);
57 #if defined(_WIN32) || ((__GNUC__ > 4) && (__GNUC_MINOR__ > 2))
58 #pragma omp parallel for schedule (dynamic, threads_)
61 for (
int idx = 0; idx < static_cast<int> (indices_->size ()); ++idx)
65 std::vector<int> nn_indices (k_);
66 std::vector<float> nn_dists (k_);
68 if (!
isFinite ((*input_)[(*indices_)[idx]]) ||
69 this->searchForNeighbors ((*indices_)[idx], search_parameter_, nn_indices, nn_dists) == 0)
71 output.
points (idx, 0) = output.
points (idx, 1) = output.
points (idx, 2) = output.
points (idx, 3) = std::numeric_limits<float>::quiet_NaN ();
77 Eigen::Vector4f xyz_centroid;
96 template <
typename Po
intInT,
typename Po
intOutT>
void
100 getViewPoint (vpx, vpy, vpz);
102 output.is_dense =
true;
104 #pragma omp parallel for schedule (dynamic, threads_)
105 for (
int idx = 0; idx < static_cast<int> (indices_->size ()); ++idx)
109 std::vector<int> nn_indices (k_);
110 std::vector<float> nn_dists (k_);
112 if (!
isFinite ((*input_)[(*indices_)[idx]]) ||
113 this->searchForNeighbors ((*indices_)[idx], search_parameter_, nn_indices, nn_dists) == 0)
115 output.points[idx].normal[0] = output.points[idx].normal[1] = output.points[idx].normal[2] = output.points[idx].curvature = std::numeric_limits<float>::quiet_NaN ();
117 output.is_dense =
false;
122 Eigen::Vector4f xyz_centroid;
133 output.points[idx].normal[0], output.points[idx].normal[1], output.points[idx].normal[2], output.points[idx].curvature);
136 output.points[idx].normal[0], output.points[idx].normal[1], output.points[idx].normal[2]);
140 #define PCL_INSTANTIATE_NormalEstimationOMP(T,NT) template class PCL_EXPORTS pcl::NormalEstimationOMP<T,NT>;
142 #endif // PCL_FEATURES_IMPL_NORMAL_3D_OMP_H_