Symbolic local refinement of tetrahedral grids

DOI10.1006/JSCO.1994.1029zbMath0811.65107OpenAlexW2004031624MaRDI QIDQ1333158

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

symbolic computationstetrahedral gridsMathematica programming languageMaubach's algorithmsimplicial refinement methodsymbolic local refinement

Mathematics Subject Classification ID

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

Related Items (3)

POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS ⋮ Geometry-guided computation of 3D electrostatics for large biomolecules ⋮ A box spline subdivision pyramid algorithm

Uses Software

• Unnamed Item

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