I have an issue of finding the cut sets of large voxel sets. The voxels are assumed connected if they touch by face/edge/vertex (can vary), and ideally what I want is given any two members of the set to find a minimal cut set of voxels that separates them into two components.
The sets are 'large', 10^7 upwards, so I'm maybe looking at some kind of multi-res method? Any pointers be appreciated.
To clarify, voxels are assumed to exist on a 3D integral lattice, and we call them 'adjacent' if the coordinates vary by 1 in at most 1 (2, or 3) dimensions (for face/edge/vertex connectedness respectively). Voxels v0 and vN are connected if there is a sequence v0,..vi,vi+1,...vN where the vi,vi+1 are adjacent.
A component is a maximal set of connected voxels, and a cut set is any subset of a component whose removal will separate the component into 2 or more components.