# Tag Info

Accepted

### Partition mesh into predetermined submeshes

For your first question, constructing the adjacency graph of the "partitions" (what you call "cell groups"): Let's say you have an array $p_K$ in which you store for each cell $K$ ...
• 52.4k

### how to partition a graph(matrix) into subdomains with different sizes

If different nodes have different costs, for example because different rows of your matrix have different numbers of nonzero entries, then you need to attach weights to each node of your graph. Graph ...
• 52.4k

### Visualization of Quad/Octree data Structures

You need to look up the VTK file format here: https://vtk.org/wp-content/uploads/2015/04/file-formats.pdf It's not very difficult, you'd just write a single cell for each node of your quad tree. The ...
• 52.4k

### What is the difference between recursive bisection and direct k-way partition?

Your intuition is correct -- a bisection method cuts the (hyper)graph in two, and recursive bisection repeatedly applies this strategy until the desired number of cuts have been made. Direct ...
• 9,013
Accepted

### Explicit polynomial for quadratic elements? (FEM)

In order to be an interpolation basis, for each node $i$ there must be a polynomial $\phi_i(\vec{r})$ such that $$\phi_i(\vec{r}_j) = \delta_{ij}$$ where $\vec{r}_j$ is the coordinate location of ...
• 1,751
Accepted

### Mesh decomposition using coordinate bisection

You can definitely use coordinate information to inform mesh partitioning, a brief sketch follows. Given some set of elements, you can form a point cloud of their centroids and then apply principal ...
• 4,604
Accepted

### Looking for Partinioning Algorithms allowing for Constraints

If I understand what you're looking for correctly, it looks like you want to compute the contour lines of constant BMI and use those as boundaries to separate your domain? A very simple algorithm for ...
• 1,751
1 vote

### Visualization of Quad/Octree data Structures

Consider the following visualization as an example. It visualizes two binary trees: $T_S$ and $T_V$ for the surface mesh of the sphere and volume mesh of the sphere, respectively. At the 0th level, ...
• 8,542
1 vote
Accepted

### simple and fast graph-clustering for paralelization of finite element simulations

For a simple (yet not optimal, see below) mesh partitioning algorithm, you can do: ...
• 2,285
1 vote

### Particle mesh Ewald: recommended splitting into short and long range

Check out: Nijboer, B. R. A., & De Wette, F. W. (1957). On the calculation of lattice sums. Physica, 23(1-5), 309–321. doi:10.1016/S0031-8914(57)92124-9 There they make the case for using a ...
• 3,984
1 vote

### Mesh partitioner that assures non empty subdomain?

I was having an issue with Metis_PartMeshDual where if my number of processors was greater than (number of elements)/2 I would get processors that were given no ...

Only top scored, non community-wiki answers of a minimum length are eligible