Symbolic local refinement of tetrahedral grids
The paper shows how a usual efficient simplicial refinement method (Maubach's algorithm) can be made even more efficient replacing numerical computations by symbolic computations. A prototype written in the Mathematica programming language is used to test the algorithms.
scientific article; zbMATH DE number 638314