/* * (C) Copyright 2013 ECMWF. * * This software is licensed under the terms of the Apache Licence Version 2.0 * which can be obtained at http://www.apache.org/licenses/LICENSE-2.0. * In applying this licence, ECMWF does not waive the privileges and immunities * granted to it by virtue of its status as an intergovernmental organisation * nor does it submit to any jurisdiction. and Interpolation */ #include "eckit/config/Resource.h" #include "eckit/log/TraceTimer.h" #include "atlas/array.h" #include "atlas/functionspace/PointCloud.h" #include "atlas/functionspace/NodeColumns.h" #include "atlas/functionspace/CellColumns.h" #include "atlas/functionspace/StructuredColumns.h" #include "atlas/interpolation/method/knn/KNearestNeighboursBase.h" #include "atlas/library/Library.h" #include "atlas/mesh/Nodes.h" #include "atlas/mesh/actions/BuildXYZField.h" #include "atlas/runtime/Trace.h" #include "atlas/util/CoordinateEnums.h" namespace atlas { namespace interpolation { namespace method { void KNearestNeighboursBase::buildPointSearchTree(Mesh& meshSource, const mesh::Halo& _halo) { ATLAS_TRACE(); eckit::TraceTimer tim("KNearestNeighboursBase::buildPointSearchTree()"); auto lonlat = array::make_view(meshSource.nodes().lonlat()); auto halo = array::make_view(meshSource.nodes().halo()); int h = _halo.size(); static bool fastBuildKDTrees = eckit::Resource("$ATLAS_FAST_BUILD_KDTREES", true); if (fastBuildKDTrees) { pTree_.reserve(lonlat.shape(0)); } for (idx_t ip = 0; ip < lonlat.shape(0); ++ip) { if (halo(ip) <= h) { pTree_.insert(PointLonLat(lonlat(ip, LON), lonlat(ip, LAT)), ip); } } pTree_.build(); // // generate 3D point coordinates // mesh::actions::BuildXYZField("xyz")(meshSource); } namespace { template void insert_tree(util::IndexKDTree& tree, const FunctionSpace_type& functionspace) { size_t ip{0}; for (auto p : functionspace.iterate().lonlat()) { tree.insert(p, ip++); } } void insert_tree(util::IndexKDTree& tree, const functionspace::NodeColumns& functionspace) { auto lonlat = array::make_view(functionspace.lonlat()); auto halo = array::make_view(functionspace.nodes().halo()); int h = functionspace.halo().size(); for (idx_t ip = 0; ip < lonlat.shape(0); ++ip) { if (halo(ip) <= h) { tree.insert(PointLonLat(lonlat(ip, LON), lonlat(ip, LAT)), ip); } } } void insert_tree(util::IndexKDTree& tree, const functionspace::CellColumns& functionspace) { auto lonlat = array::make_view(functionspace.lonlat()); auto halo = array::make_view(functionspace.cells().halo()); int h = functionspace.halo().size(); for (idx_t ip = 0; ip < lonlat.shape(0); ++ip) { if (halo(ip) <= h) { tree.insert(PointLonLat(lonlat(ip, LON), lonlat(ip, LAT)), ip); } } } void insert_tree(util::IndexKDTree& tree, const functionspace::StructuredColumns& functionspace) { auto lonlat = array::make_view(functionspace.lonlat()); for (idx_t ip = 0; ip < lonlat.shape(0); ++ip) { tree.insert(PointLonLat(lonlat(ip, LON), lonlat(ip, LAT)), ip); } } } // namespace void KNearestNeighboursBase::buildPointSearchTree(const FunctionSpace& functionspace) { ATLAS_TRACE(); eckit::TraceTimer timer("KNearestNeighboursBase::buildPointSearchTree()"); static bool fastBuildKDTrees = eckit::Resource("$ATLAS_FAST_BUILD_KDTREES", true); if (fastBuildKDTrees) { pTree_.reserve(functionspace.size()); } if (functionspace::PointCloud fs = functionspace) { insert_tree(pTree_, fs); } else if (functionspace::NodeColumns fs = functionspace) { insert_tree(pTree_, fs); } else if (functionspace::CellColumns fs = functionspace) { insert_tree(pTree_, fs); } else if (functionspace::StructuredColumns fs = functionspace) { insert_tree(pTree_, fs); } else { ATLAS_NOTIMPLEMENTED; } pTree_.build(); } bool KNearestNeighboursBase::extractTreeFromCache(const Cache& c) { IndexKDTreeCache cache(c); if (cache) { pTree_ = cache.tree(); return true; } return false; } } // namespace method } // namespace interpolation } // namespace atlas