AI 中文总结
本文证明Knupp猜想：三线性六面体边界上雅可比行列式为正即可保证整体为正，并给出基于有限边界点评估的六面体验证算法。
AI 中文摘要
三线性六面体网格单元在有限元分析中用于模拟体积现象。模拟的真实性要求网格单元在三线性映射下保持正体积，即数学上要求三线性映射保持正的雅可比行列式（jacdet）。虽然jacdet的正性通常需要在整个单元体积内验证，但我们证明了Knupp猜想，该猜想认为对于三线性六面体，边界上jacdet的正性足以保证整个单元内的正性。我们进一步证明，对于任何有效的六面体，其全局最小jacdet必须位于边界上。最后，我们证明，在六面体（无论是否有效）的边界上，全局最小jacdet必定在由四次求根确定的有限候选点集中取得。综合这些结果，我们可以通过评估六面体在有限边界点集上的jacdet来算法性地验证六面体。
英文摘要
Trilinear hexahedral mesh elements are used in finite element analysis to simulate volumetric phenomena. Realism of the simulation mandates that mesh elements through the trilinear map maintain positive volume, or mathematically, that the trilinear map maintains positive Jacobian determinant (jacdet). While jacdet positivity generally needs to be verified in the full element volume, we prove Knupp's conjecture which posits that for trilinear hexahedra, jacdet positivity on the boundary of the element is sufficient to guarantee positivity in the entire element. We further prove that for any valid hexahedron, its globally minimal jacdet must reside on the boundary. Lastly, we prove that the globally minimal jacdet on the boundary of a hexahedron, valid or not, must be achieved within a finite set of candidate points that can be determined by quartic root finding. Combining these results, we can algorithmically validate a hexahedron through evaluation of its jacdet on a finite set of boundary points.
