An omnitree that bisects only selected dimensions per node can raise dyadic AMR convergence by up to the dimension count d for strongly anisotropic problems; on 4,166 shapes it improved mean convergence 1.5x versus octrees.
P4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations
An omnitree that bisects only selected dimensions per node can raise dyadic AMR convergence by up to the dimension count d for strongly anisotropic problems; on 4,166 shapes it improved mean convergence 1.5x versus octrees.