DNDS::Geom::detail Namespace Reference

Classes
struct	CellPermutationResult
	Result of local cell permutation computation. More...

Functions
CellPermutationResult	ComputeCellPermutation (tLocalMatStruct &cell2cellFaceV, const tAdjPair &cell2cell, index nCell, int nParts, int nPartsInner)

Function Documentation

ComputeCellPermutation()

CellPermutationResult DNDS::Geom::detail::ComputeCellPermutation ( tLocalMatStruct &  cell2cellFaceV, const tAdjPair &  cell2cell, index  nCell, int  nParts, int  nPartsInner  )

inline

Compute a cell reordering permutation using Metis partitioning with optional inner partitioning and contiguous sorting.

1. Partition via Metis + RCM.
2. Optionally sub-partition each first-level partition.
3. Within each partition, sort cells so interior (private) cells come before cells that touch ghost neighbors.
4. Build inverse permutation.

Parameters

cell2cellFaceV	Local face-adjacency graph (no ghost edges).
cell2cell	Full cell-to-cell adjacency (with ghost).
nCell	Number of local (father) cells.
nParts	Number of first-level partitions.
nPartsInner	Number of inner partitions per first-level part.

Definition at line 42 of file Mesh_CellPermutation.hpp.

Here is the call graph for this function:

Here is the caller graph for this function: