geometry Namespace Reference

Collection of methods and data related to geometry. More...

Data Structures
class	Fracture
	A class for fracture state of bonds. More...

Functions
void	computeNonlocalNeighborhood (const std::vector< util::Point > &nodes, double horizon, std::vector< std::vector< size_t > > &nodeNeighs)
	Partitions the nodes based on node neighborlist supplied. Function first creates a graph with nodes as vertices and edges given by node neighbors. Then the metis function is called to partition the graph into specified number of parts.

Detailed Description

Collection of methods and data related to geometry.

Function Documentation

computeNonlocalNeighborhood()

void geometry::computeNonlocalNeighborhood	(	const std::vector< util::Point > &	nodes,
		double	horizon,
		std::vector< std::vector< size_t > > &	nodeNeighs
	)

Partitions the nodes based on node neighborlist supplied. Function first creates a graph with nodes as vertices and edges given by node neighbors. Then the metis function is called to partition the graph into specified number of parts.

Parameters

nodes	Nodal coordinates
horizon	Nonlocal radius
nodeNeighs	Neighborlist of nodes

Definition at line 17 of file geometryUtil.cpp.

                                                                                {
  nodeNeighs.resize(nodes.size());
 
  auto nsearch_p = std::make_unique<NSearch>(nodes);
  double set_tree_time = nsearch_p->updatePointCloud(nodes, true);
  set_tree_time += nsearch_p->setInputCloud();
  std::cout << fmt::format("Tree setup time (ms) = {}. \n", set_tree_time);
 
  for (size_t i=0; i<nodes.size(); i++) {
    std::vector<size_t> neighs;
    std::vector<double> sqr_dist;
    nodeNeighs[i].resize(0);
 
    if (nsearch_p->radiusSearch(nodes[i], horizon, neighs, sqr_dist) > 0) {
      for (std::size_t j = 0; j < neighs.size(); ++j)
        if (neighs[j] != i) {
          nodeNeighs[i].push_back(neighs[j]);
        }
    }
  }
}

Referenced by test::testGraphPartitioning(), and test::testMPI().

Here is the caller graph for this function: