16 double sum_of_sqr(0.0);
18 std::size_t n_sampling(0);
19 std::vector<MeshLib::Element*>
const& elements(
_mesh.getElements());
23 for (
auto element : elements)
25 std::size_t
const n_edges(element->getNumberOfEdges());
26 for (std::size_t k(0); k < n_edges; k++)
30 double const len = edge->getContent();
33 sum_of_sqr += len * len;
35 n_sampling += n_edges;
42 auto const [min, max] =
44 sum += std::sqrt(min);
47 n_sampling =
_mesh.getNumberOfElements();
50 const double mean(sum / n_sampling);
51 const double variance((sum_of_sqr - (sum * sum) / n_sampling) /
60 if (variance < mean * mean / 4)
71 "[MeshNodeSearcher::MeshNodeSearcher] Calculated search length for "
72 "mesh '{:s}' is {:f}.",
std::pair< double, double > computeSqrNodeDistanceRange(MeshLib::Element const &element, bool const check_allnodes)
Compute the minimum and maximum node distances for this element.