The geometric methods are the easiest non-trivial partitioners to incorporate into applications, as they require only four callbacks: two returning object information and two returning coordinate information.
We group refinement-tree partitioning for adaptive mesh refinement applications into the geometric partitioners because it uses geometric information to determine an initial ordering for coarse elements of adaptively refined meshes. The refinement-tree partitioner also requires tree-based callbacks with connectivity information between coarse and fine elements in refined meshes.
Recursive Coordinate Bisection (RCB)
Recursive Inertial Bisection (RIB)
Hilbert Space-Filling Curve Partitioning (HSFC)
Refinement Tree Based Partitioning (Reftree)