arXiv (All)
open access
Closure complexity of Bänsch-type algorithms for tetrahedral mesh refinement
We prove, to our knowledge, the first unconditional cumulative closure estimates for the Arnold--Mukherjee--Pouly (AMP) refinement algorithm and the original face-marked tetrahedral algorithm of Bänsch on arbitrary conforming initial tetrahedral meshes. Let $T_0,\ldots,T_L$ be an adaptive mesh seque
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convex Quadratic Distance Field Computation#985004
- On degeneration of tetrahedra under longest-edge n-section refinement#1077082
- Orthogonal grid generation, non-reflecting boundary condition, and parallel computation for fluid flow#957727
- Nonlinear filtering stabilizations for the quasi-geostrophic equations#1123391
- Work Stealing for the 2D-Mesh Topology of Satellite Constellations in Low Earth Orbit#271790
Record · ID 1077544
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive