Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions (Q1947986)

Well-centered simplices are of importance in not only a mesh generation but also in designing numerical methods for partial differential equations. It is commonly known that ``an \(n\)-simplex is \(n\)-well-centered if its circumcenter lies in its interior''. In this paper, the authors give additional geometric and algebraic conditions of being \(n\)-well-centered. Using these conditions, they investigate geometric and combinatorial properties of well-centered triangulations. They find that the properties of well-centerness in \(\mathbb{R}^2\) is very different from when they are considered in \(\mathbb{R}^3\) or higher. The authors also raise some interesting open questions on combinatorial properties of well-centered meshes at the end of this paper.