Answers are grounded in this paper and cite their sources.
This paper describes data structures and algorithms for the automatic generation of adaptive subgrids, a technique used with adaptive mesh refinement for solving partial differential equations. Our algorithms generate a nested sequence of finer and finer grids on an underlying coarse grid. There are two aspects to the data structures. Trees are used to do the grid management for this type of grid structure.Secondly, the automatic grid generation algorithms use data structures with special nearest neighbor properties. Examples of grids from actual adaptive numerical computations are shown.
No takes yet. Share an insight, caveat, or question.
Marsha Berger (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: