// Copyright (c) 2018 GeometryFactory Sarl (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v5.2/Classification/include/CGAL/Classification/Feature/Gradient_of_feature.h $ // $Id: Gradient_of_feature.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Simon Giraudot #ifndef CGAL_CLASSIFICATION_GRADIENT_OF_FEATURE_H #define CGAL_CLASSIFICATION_GRADIENT_OF_FEATURE_H #include #include // Experimental feature, not used officially and not documented yet /// \cond SKIP_IN_MANUAL namespace CGAL { namespace Classification { namespace Feature { /*! \ingroup PkgClassificationFeatures TODO */ template class Gradient_of_feature : public Feature_base { const InputRange& m_input; ItemMap m_map; Feature_handle m_feature; boost::shared_ptr m_query; public: /*! TODO */ Gradient_of_feature (const InputRange& input, ItemMap map, Feature_handle feature, const NeighborQuery& neighbor_query) : m_input (input), m_map (map), m_feature (feature), m_query (new NeighborQuery(neighbor_query)) { std::ostringstream oss; oss << "gradient_of_" << feature->name(); this->set_name (oss.str()); } /// \cond SKIP_IN_MANUAL virtual float value (std::size_t pt_index) { std::vector neighborhood; (*m_query) (get (m_map, *(m_input.begin()+pt_index)), std::back_inserter (neighborhood)); if (neighborhood.empty()) return 0.f; float mean = 0.f; for (std::size_t i = 0; i < neighborhood.size(); ++ i) mean += m_feature->value (neighborhood[i]); return (m_feature->value (pt_index) - mean / neighborhood.size()); } /// \endcond }; } // namespace Feature } // namespace Classification } // namespace CGAL /// \endcond #endif // CGAL_CLASSIFICATION_GRADIENT_OF_FEATURE_H