Answers are grounded in this paper and cite their sources.
Analysis reveals a novel algorithm for computing curvature in simplicial complexes, highlighting geometric applications in discrete gravity.
We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the surface in question to its four closest neighbors, forming quads. We then focus on the simplices of $$d=2$$ d = 2 , or triangles embedded in these quads, which make up a pure simplicial complex with $$d=2$$ d = 2 . This allows us to numerically compute the local metric along with zweibeins, which subsequently leads to a derivation of discrete curvature defined at every triangle or face. We provide an efficient algorithm with O(N log N) O ( N log N ) complexity that first orients two-dimensional surfaces, solves the nonlinear system of equations of the spin-connections resulting from the torsion condition, and returns the value of curvature at each face.
No takes yet. Share an insight, caveat, or question.
Chamseddine et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: