A multimesh hierarchically encodes a collection of simplicial meshes of possibly different dimensions as a tree whose edges are containment maps preserving the face relationship. Each mesh keeps its own explicit navigation and attributes, and a local topological operation (edge split, collapse, or swap) applied to any mesh is automatically propagated to all others by extending and restricting the operation across the tree and updating the containment maps, keeping correspondences such as UV seams or embedded surfaces coherent without ad-hoc tagging. Students learn to represent inter-mesh correspondences with dimension-agnostic dart navigation and to reuse single-mesh algorithms on embedded structures.
This computer-graphics paper introduces the multimesh: a data structure and algorithmic framework for hierarchically encoding a collection of simplicial meshes of possibly different dimensions (for e…