partitioning algorithm that uses the underlying geometry of the hypergraph to generate the partitioning (which is largely done using shared-memory parallelism). Hypergraph geometry may either be provided from the problem at hand or generated by the partitioning software. This entire process is illustrated in .

  ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
   ![The matrices `twotone` (top) and `ford2` (bottom). For the original matrix (left), a visual representation is created (middle), which in turn is used to permute the matrix to recursive Bordered Block Diagonal form (right).[]{data-label="fig:vmoprocess"}](twotone_orig "fig:"){width="3.6cm"}   ![The matrices `twotone` (top) and `ford2` (bottom). For the original matrix (left), a visual representation is created (middle), which in turn is used to permute the matrix to recursive Bordered Block Diagonal form (right).[]{data-label="fig:vmoprocess"}](twotone_layout_small "fig:"){width="3.5cm"}   ![The matrices `twotone` (top) and `ford2` (bottom). For the original matrix (left), a visual representation is created (middle), which in turn is used to permute the matrix to recursive Bordered Block Diagonal form (right).[]{data-label="fig:vmoprocess"}](twotone_permute "fig:"){width="3.6cm"}
    ![The matrices `twotone` (top) and `ford2` (bottom). For the original matrix (left), a visual representation is created (middle), which in turn is used to permute the matrix to recursive Bordered Block Diagonal form (right).[]{data-label="fig:vmoprocess"}](ford2_orig "fig:"){width="3.6cm"}    ![The matrices `twotone` (top) and `ford2` (bottom). For the original matrix (left), 