Simplicial isosurfacing in arbitrary dimension and codimension (Q1408435)

An efficient isosurfacing algorithm that works in an arbitrary number of dimensions and codimensions is introduced. The simplicial interpolation algorithm is briefly reviewed, the triangulation tables of the intersection of a simplex and a hyperplane are given, and a counting theorem is stated to prove the optimality of the tables. A visualisation of the projected isosurface in discussed. A dyadic grid is introduced to reduce the numerical costs. Numerical examples are constructed by the proposed isosurface algorithm.