Symbolic local refinement of tetrahedral grids

DOI10.1006/JSCO.1994.1029MaRDI QIDQ1333158zbMATH OpenOpenAlexFDO

Authors D. J. Hebert

Publication date 2 May 1995

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1994.1029

zbMATH Keywords

Mathematica programming languageMaubach's algorithmsimplicial refinement methodsymbolic computationssymbolic local refinementtetrahedral grids

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Symbolic computation and algebraic computation (68W30)

Review text

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.

Recommendations

• Local refinement of simplicial grids based on the skeleton
• Local refinements of tetrahedral meshes
• Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• Tetrahedral grid refinement

Cited in

(4)

• A box spline subdivision pyramid algorithm
• Local refinement of simplicial grids based on the skeleton
• Geometry-guided computation of 3D electrostatics for large biomolecules
• POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Symbolic local refinement of tetrahedral grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333158)