Commit 28445994 authored by Paul Schütze's avatar Paul Schütze Committed by Simon Spannagel
Browse files

Apply 3 suggestion(s) to 2 file(s)

parent cde780c6
Loading
Loading
Loading
Loading
+1 −1
Original line number Diff line number Diff line
@@ -405,7 +405,7 @@ int main(int argc, char** argv) {
                        continue;
                    }

                    // If we have too many neighbors, we could dcay to using lower-dimension interpolation:
                    // If we have too many neighbors, we could decay to using lower-dimension interpolation:
                    if(allow_decay && radius > initial_radius && results.size() > 100) {
                        LOG_ONCE(WARNING) << "Large number of neighbors found, this hints to a quasi-co"
                                          << (dimension == 3 ? "planar" : "linear") << " situation" << std::endl
+2 −2
Original line number Diff line number Diff line
@@ -13,8 +13,8 @@ closest-neighbor mode and interpolation mode:
### Simple Closest-Neighbor Search

In this mode, selected by setting the parameter `interpolate = false`, no interpolation of field values is performed, but for
every output mesh point, the values from the closest neighbor of the input mesh is taken. In most cases this approach should
produce reasonably precise results with a granularity similar to the respective adaptive mesh granularity in the respective
every output mesh point, the values from the closest neighbor of the input mesh are taken. In most cases this approach should
produces reasonably precise results with a granularity similar to the respective adaptive mesh granularity in the respective
region. The tool uses the Octree `findNeighbor` algorithm \[[@octree]\] to find the closest neighbor to the query point.

### Barycentric Interpolation Method