Abstract
The Generalized Combinatorial Marching Hypercubes (GCMH) algorithm was developed to calculate an approximation by a cellular complex of a manifold of any dimension and co-dimension, that is, a manifold of dimension n-k immersed in an n-dimensional space. This algorithm uses combinatorial and topological methods to avoid using expensive lookup tables and is therefore efficient in higher di…