arXiv (All)
open access
Largest-dihedral-angle bisection algorithm does not preserve mesh regularity for tetrahedral partitions
We present a fixed nondegenerate tetrahedron with a nested largest-dihedral-anglebisection branch that collapses onto a unit edge. The selected dihedral angles to bisect are uniquely largest ones at every bisection step. Some face angles of the branch elements tend to zero, the corresponding diamete
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
- On the treatment of topology changes on 3D polyhedral moving meshes via 4D space-time hole-like elements in direct ALE ADER-DG methods#665775
- On the treatment of topology changes on 3D polyhedral moving meshes via 4D space-time hole-like elements in direct ALE ADER-DG methods#664275
- Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space#1013339
- An advancing-ridge approach for recovering boundary $(d-1)$-simplices in $d$-dimensional meshes#612599
- An advancing-ridge approach for recovering boundary $(d-1)$-simplices in $d$-dimensional meshes#611122
Record · ID 1012952
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