High-Order Approximation of Gaussian Curvature with Regge Finite Elements
Evan S. Gawlik

TL;DR
This paper introduces a high-order method for approximating Gaussian curvature on triangulated surfaces using Regge finite elements, providing error estimates and a generalization of classical angle defect techniques.
Contribution
It develops a novel high-order approximation framework for Gaussian curvature based on Regge finite elements, extending classical methods and providing rigorous error analysis.
Findings
Error estimates in Sobolev norms for high-order approximations
Relation between angle defect linearization and div-div operator discretization
Generalization of angle defect to higher order methods
Abstract
A widely used approximation of the Gaussian curvature on a triangulated surface is the angle defect, which measures the deviation between and the sum of the angles between neighboring edges emanating from a common vertex. We show that the linearization of the angle defect about an arbitrary piecewise constant Regge metric is related to the classical Hellan-Herrmann-Johnson finite element discretization of the div-div operator. Integrating this relation leads to an integral formula for the angle defect which is well-suited for analysis and generalizes naturally to higher order. We prove error estimates for these high-order approximations of the Gaussian curvature in -Sobolev norms of integer order .
| Error | Order | Error | Order | Error | Order | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\newsiamremark
remarkRemark
\headers
Gaussian Curvature with Regge Finite ElementsE. S. Gawlik
High-Order Approximation of Gaussian Curvature with Regge Finite Elements††thanks: The author was supported in part by the NSF under grant DMS-1703719.
Evan S. Gawlik Department of Mathematics, University of Hawaii at Manoa () [email protected]
Abstract
A widely used approximation of the Gaussian curvature on a triangulated surface is the angle defect, which measures the deviation between and the sum of the angles between neighboring edges emanating from a common vertex. We show that the linearization of the angle defect about an arbitrary piecewise constant Regge metric is related to the classical Hellan-Herrmann-Johnson finite element discretization of the operator. Integrating this relation leads to an integral formula for the angle defect which is well-suited for analysis and generalizes naturally to higher order. We prove error estimates for these high-order approximations of the Gaussian curvature in -Sobolev norms of integer order .
keywords:
Regge finite element, angle defect, Hellan-Herrmann-Johnson, Gaussian curvature, Ricci scalar, Regge calculus, Riemannian metric, scalar curvature
{AMS}
65N30, 65N15, 65D18, 83C27
1 Introduction
One of the most widely used approximations of the Gaussian curvature on a triangulated surface is the angle defect: minus the sum of the angles between neighboring edges emanating from a common vertex. This approximation (and its generalization to higher dimensions) is used in several applications, including discrete analogues of Ricci flow [10, 21], discrete theories of relativity [25, 1], discrete differential geometry [19, 28], and computer graphics algorithms [22, 13, 27]. Despite its widespread use, the angle defect leaves much to be desired if one is interested in accurately approximating the curvature of a smooth surface (or smooth Riemannian manifold) with a discretization thereof. It is manifestly a low-order approximation of the curvature, relying in essence on piecewise constant approximations of the underlying smooth metric tensor.
In this paper, we introduce and analyze a family of high-order approximations of the Gaussian curvature using piecewise polynomial approximations of the metric tensor. The cornerstone of our construction is an integral formula for the angle defect that mimics a certain integral formula for the Gaussian curvature which is valid in the smooth setting. In the discrete setting, the integral formula follows from the observation that the linearization of the angle defect about an arbitrary piecewise constant metric (more precisely, a piecewise constant Regge metric) is related to the classical Hellan-Herrmann-Johnson finite element discretization of the operator. This observation generalizes one made by Christiansen [11], who derived the linearization of the angle defect about the Euclidean metric and related it to the jumps in the tangential-normal components of the metric perturbation (see Remark 3.5 for more details).
To generalize the angle defect to higher order, we rely on the Regge finite element spaces recently developed by Li [24], which have their origins in the work of Christiansen [11]. These finite element spaces consist of piecewise polynomial -tensor fields with continuous tangential-tangential components across element interfaces. In the lowest order setting, a positive definite Regge finite element realizes a piecewise flat triangulation whose (squared) edge lengths correspond to the degrees of freedom for the finite element space.
The advantages of high-order approximation of the Gaussian curvature are easily illustrated with an example. Consider the square equipped with the Riemannian metric
[TABLE]
where . This is nothing more than the induced metric for the surface in . The exact Gaussian curvature of is
[TABLE]
Figure 1 plots the approximate Gaussian curvature of , as computed using Definition 3.1 below with piecewise polynomial approximations of of degree on the triangulation of depicted in Figure 1a. As we will show later in this paper, the approximate curvature produced by Definition 3.1 in the case is precisely the angle defect, normalized by the consistent mass matrix for piecewise linear finite elements. (In the interest of fairness, we normalized by a lumped mass matrix to produce Figure 1b; the appearance of Figure 1b worsens if the consistent mass matrix is used.) Notice that the results for and are not particularly satisfactory. This should come as no surprise; one expects the second derivatives of a degree- polynomial approximation of to converge in -Sobolev norms under mesh refinement, but not in stronger norms. A chief goal of this paper is to verify this intuition with an error estimate.
Our error analysis complements a number of related results in the literature on scalar curvature approximation. Cheeger, Müller, and Schrader [8] prove that the angle defect converges in the sense of measures to the (densitized) scalar curvature if a smooth Riemannian manifold (not necessarily of dimension 2) is approximated with a suitable sequence of triangulations. Christiansen [12] proves a dual result: if a piecewise constant metric is approximated with a sequence of mollifications thereof, then the exact (densitized) scalar curvature of the mollified metric converges in the sense of measures to the angle defect. Other analyses of the angle defect appear in [5, 29] and the references therein; many of these analyses are guided by Taylor expansions on parametrized surfaces and impose special conditions on the triangulation. Our error analysis will focus not on the angle defect but instead on its higher order generalizations.
There appear to be relatively few studies on Gaussian curvature approximation that offer quantitative error bounds in Sobolev norms like the bounds in Theorem 4.1 below. Fritz [17] has proven bounds of this type for a curvature approximation which uses isoparametric approximations of surfaces embedded in . His results apply more generally to Ricci tensor approximation on hypersurfaces, and have been used to discretize Ricci flow [18]. However, they are inapplicable if the manifold does not admit a codimension-one embedding into Euclidean space. Note that studies related to mean curvature approximation are more widespread; see, for instance, [20, 4, 14, 23].
This paper is organized as follows. In Section 2, we introduce our notation and point out an integral formula for the Gaussian curvature. In Section 3, we discretize this integral formula with the aid of Regge finite elements, and we show that it reduces to the angle defect in the lowest-order setting. We state and prove error estimates for the aforementioned discretization in Section 4. We conclude with numerical examples in Section 5.
For simplicity, we perform much of the forthcoming analysis on a triangulated polygonal domain in equipped with a non-Euclidean metric. Note, however, that the curvature approximations we introduce are coordinate-free and can be readily applied to two-dimensional orientable simplicial complexes with more general topology. We refer the reader to [24] for the appropriate definitions of the Regge finite elements in this general setting. Importantly, our curvature approximations do not rely on (nor assume the existence of) an embedding of the manifold under consideration in .
2 Curvature in the Smooth Setting
2.1 Preliminaries
Let be a polygonal domain. We use standard notation for the Sobolev spaces of differentiability index and integrability index . We denote and .
Let be a smooth Riemannian metric on . Fix coordinates on so that may be regarded as a map from to . If is a scalar field on , then we denote and . If is a vector field on , then we regard it as a column vector and denote and .
The Riemannian Hessian of a scalar field is denoted . In coordinates,
[TABLE]
Here, the Einstein summation convention is adopted, and are the Christoffel symbols of the second kind. That is,
[TABLE]
where denotes the -component of , and denotes the -component of . The Laplacian of is
[TABLE]
If is a symmetric -tensor field on , then we regard it as a map from to and denote its components by . In a slight abuse of notation, we denote by the vector field with components
[TABLE]
where . We omit the subscript if is the Euclidean metric . Thus, , , etc.
The Gaussian curvature of is denoted ; it is half the scalar curvature :
[TABLE]
Because is two-dimensional, the Ricci tensor is proportional to the metric:
[TABLE]
2.2 Linearization of the Curvature
Let be the volume form on induced by . The linearization of about will be of fundamental importance in this paper. For any smooth , we have
[TABLE]
where
[TABLE]
This can be seen by combining the well-known relations ([16, Lemma 2], [9, Equation 2.11])
[TABLE]
with (2), noting that for any scalar field .
Another way of writing (3) is as follows. Let
[TABLE]
be the -inner product on induced by . Then, for any scalar function ,
[TABLE]
Since the Euclidean metric has zero curvature, integrating the above relation leads to the integral formula
[TABLE]
where
[TABLE]
Our strategy for discretizing will be to discretize the integral formula (6).
3 Discretization
Let be a shape-regular, quasi-uniform family of triangulations of parametrized by , where denotes the diameter of a triangle . In other words, there are constants and such that for every ,
[TABLE]
where denotes the inradius of .
Let be an edge of a triangle . The outward unit normal vector to along relative to the Euclidean metric is denoted , and the unit tangent vector relative to the Euclidean metric is , where . Relative to , the unit tangent and normal vectors are
[TABLE]
One checks that and since . We also note that if , then
[TABLE]
owing to the definition (4) of and the identity .
Let denote the set of edges of triangles in , and let denote the set of interior edges; these are the edges with . Let be a scalar field. Along any edge , we denote
[TABLE]
If is on the boundary of , we denote
[TABLE]
Let
[TABLE]
and
[TABLE]
Note that and depend on , but we have omitted a subscript to emphasize that they are infinite-dimensional spaces. We define a metric-dependent bilinear form by
[TABLE]
where
[TABLE]
and
[TABLE]
The bilinear form is well-studied. In view of (9), it is (up to the appearance of ) a non-Euclidean generalization of the bilinear form used to discretize the operator in the classical Hellan-Herrmann-Johnson mixed discretization of the biharmonic equation [3, 2, 7]. See [24, Section 4.2] for more insight into this connection in the Euclidean setting.
Now let and , and define finite-dimensional subspaces
[TABLE]
and
[TABLE]
where denotes the space of polynomials of degree on . The space is the space of Regge finite elements of degree [24, 11].
Of particular importance to us will be the space of positive definite Regge finite elements,
[TABLE]
We define the discrete Gaussian curvature of a metric as follows.
Definition 3.1**.**
Let , , and . The discrete Gaussian curvature of is the unique function satisfying
[TABLE]
Note that for each , the value of depends only on the values of in . Thus, Definition 3.1 extends readily to orientable triangulations with more general topology: for each function in the canonical basis for , one computes the spatial integral in (10) over , which (generically) is a patch of triangles admitting a Euclidean metric.
One of our main reasons for favoring this definition is that when , reduces to the popular angle defect. In detail, let be the vertices of , enumerated in such a way that if and only if . Let be the basis for defined by
[TABLE]
Theorem 3.2**.**
Let , , and . For every , we have
[TABLE]
*where is the set of triangles in sharing vertex , and is the interior angle of at vertex as measured by . *
The preceding theorem is a consequence of the following identity that mimics (5).
Lemma 3.3**.**
Let , , , , and . For each and sufficiently small, let be the interior angle of at vertex as measured by . Then
[TABLE]
Proof 3.4**.**
Let be a triangle with edges , , and of length , , and relative to . Assume that is opposite the angle . Differentiating the law of cosines
[TABLE]
with respect to at and solving for gives
[TABLE]
where is the area of relative to and , , etc. On the other hand, we have
[TABLE]
and
[TABLE]
Indeed, the relations in (12) follow from the fact that relative to , is a vector of length that is perpendicular to the edge . The relations in (13) follow from differentiating the identity
[TABLE]
and its counterpart for the edges and . Summing over all and noting that on each , we conclude that
[TABLE]
*Since vanishes on each , the relation (11) follows. *
Remark 3.5**.**
*Let us clarify the distinction between the preceding lemma and the results of Christiansen [11]. Christiansen works in three dimensions and computes the first- and second-order variation of the Regge action ( being the angle defect at an edge , and being its length) around the Euclidean metric. He notes that the first variation vanishes (a fact proven by Regge [25]), while the second variation is related to the distributional operator (which coincides with the operator in two dimensions). Along the way, he relates the linearization of around the Euclidean metric to a summation of jumps of (see [11, Proposition 2]). With some manipulation, this relation can be restated in the form of Theorem 3.3 with . Note that the case is not addressed in [11]; this missing ingredient plays a crucial role in our work. *
4 Error Estimates
In this section, we prove error estimates for in -Sobolev norms of integer order .
Denote
[TABLE]
and . Also let
[TABLE]
Note that if the eigenvalues of are bounded above and below by positive constants on , then the norms and are equivalent to the norms and , respectively. These facts imply that (15) is equivalent to the norm obtained by replacing with in the denominator of (15).
Our analysis will make use of the broken Sobolev norms
[TABLE]
with the obvious modifications for . We denote , and we use analogous notation and for the corresponding broken Sobolev semi-norms.
For and , we denote
[TABLE]
Note that the condition is meaningful for , since the Sobolev embedding theorem implies that elements of with are continuous on . It is known that for and , the curvature operator maps into [16, Lemma 1].
Theorem 4.1**.**
Let . Suppose that is a sequence satisfying , , and . Then there exists a constant depending on , , , , , , , and the shape regularity and quasi-uniformity constants and such that for every sufficiently small,
[TABLE]
Furthermore, if with , then for each and each ,
[TABLE]
*for every sufficiently small. *
Note that the theorem is vacuous when , since we generally cannot expect to decay faster than . It should also be noted that the assumptions in the theorem statement guarantee that for sufficiently small, so that is well-defined. See Section 4.2 for more details.
Our proof will be structured as follows. First, we verify in Lemma 4.6 that the exact Gaussian curvature satisfies
[TABLE]
for every . Next, we consider an arbitrary and write
[TABLE]
with . The three terms above are estimated in Propositions 4.14, 4.16, and 4.18. Combining them will lead to Theorem 4.1.
4.1 Consistency of
We begin by recalling two integration-by-parts formulas.
Lemma 4.2**.**
Let . For every and every , we have
[TABLE]
In addition, for every and every , we have
[TABLE]
Proof 4.3**.**
The (Euclidean) divergence theorem gives
[TABLE]
where we have used the fact that
[TABLE]
To prove (20), note first that
[TABLE]
which can be verified by expanding both sides in coordinates. The formula (20) now follows from the observation that
[TABLE]
*where we have used (21) again. *
Lemma 4.4**.**
For every and every ,
[TABLE]
Proof 4.5**.**
Let . Recalling that , we have
[TABLE]
Using the fact that , the first and third terms can be combined to give
[TABLE]
Integrating the second term by parts, we obtain
[TABLE]
Since , both and its tangential derivative are continuous across element interfaces, and they vanish on . In particular, for every . On the other hand, since , is continuous across element interfaces, and for every . It follows that the summations over in (23) vanish. Thus,
[TABLE]
Lemma 4.6**.**
For every ,
[TABLE]
Proof 4.7**.**
Let and . From (5), we obtain
[TABLE]
so
[TABLE]
4.2 Basic Estimates
We now collect a few basic estimates in preparation for our estimation of .
Throughout what follows, we make use of the fact that the eigenvalues of , being positive and continuous on , are bounded above and below by positive constants and that depend on and . Hence, for any , we have
[TABLE]
It follows also that and are each bounded above by constants depending on and . Differentiation then reveals that and are each bounded above by constants depending on and .
We will use this information to establish analogous estimates for , under the assumption that and . From this point forward, we use the letter to denote a constant which is not necessarily the same at each occurrence and may depend on , , , , , , , and the shape regularity and quasi-uniformity constants and , but not on .
Lemma 4.8**.**
Let . For every sufficiently small,
[TABLE]
Proof 4.9**.**
The identity
[TABLE]
shows that for sufficiently small,
[TABLE]
Thus, for every and every , the operator norm of satisfies
[TABLE]
It follows that
[TABLE]
*for sufficiently small. Taking small enough so that (say) completes the proof. *
From the above lemma and the assumption that , we conclude that for sufficiently small,
[TABLE]
In particular, the eigenvalues of are bounded above and below by positive constants independent of , and estimates of the form
[TABLE]
and
[TABLE]
hold for sufficiently small. In the remainder of this section, we will tacitly assume that is small enough that the preceding estimates hold.
Lemma 4.10**.**
For every and ,
[TABLE]
Proof 4.11**.**
Let and . The identity
[TABLE]
shows that
[TABLE]
and the identity
[TABLE]
shows that
[TABLE]
To obtain the estimate, we compute
[TABLE]
which gives
[TABLE]
From this, (25), and Lemma 4.8, we conclude that
[TABLE]
4.2.1 The -Orthogonal Projector
Let denote the -orthogonal projector onto , so that
[TABLE]
Lemma 4.12**.**
We have
[TABLE]
Proof 4.13**.**
For any and any , we have
[TABLE]
The equivalence of the norms and implies
[TABLE]
so . Since was arbitrary, (27) follows. It follows also that if . Now let denote the Scott-Zhang interpolation operator [26]. Using an inverse estimate, interpolation estimates, and the stability of in , we obtain
[TABLE]
Finally, for any ,
[TABLE]
so
[TABLE]
4.3 Proof of Theorem 4.1
We are now ready to estimate the three terms in (18).
Proposition 4.14**.**
If , then
[TABLE]
Proof 4.15**.**
For any , we have
[TABLE]
so
[TABLE]
*Taking and invoking the -estimate (26) completes the proof. *
Proposition 4.16**.**
For sufficiently small, we have
[TABLE]
Proof 4.17**.**
By Lemma 4.10 and the inverse estimate [6, Lemma 4.9.2], we have
[TABLE]
Now note that
[TABLE]
The second term above is bounded by a constant (a multiple of ) owing to (27). For the first term, an inverse estimate gives
[TABLE]
Thus, using the -estimate (26), we obtain
[TABLE]
for sufficiently small, since [15, Equation 1.99]. It follows that
[TABLE]
*Combining this with (29) completes the proof. *
We will now estimate the first term in (18). We state the result below, and prove it with a series of lemmas.
Proposition 4.18**.**
We have
[TABLE]
To prove Proposition 4.18, let and , so that
[TABLE]
Note that , being a convex combination of and , has eigenvalues bounded above and below by positive constants independent of (and ), and all of the estimates we established for the norms of , , , etc. carry over easily to , , , etc.
Lemma 4.19**.**
For every ,
[TABLE]
Proof 4.20**.**
Let . We have
[TABLE]
where
[TABLE]
Along any edge , we may write
[TABLE]
so, with and , we have
[TABLE]
Writing
[TABLE]
shows that for each with ,
[TABLE]
The trace inequality then gives, if ,
[TABLE]
For edges on , the same estimate holds with terms involving replaced by zero.
Turning now to , observe that
[TABLE]
Observe also that
[TABLE]
where
[TABLE]
and are the Christoffel symbols associated with . If is defined similarly with in place of , then it is not hard to see that
[TABLE]
and
[TABLE]
so
[TABLE]
Using a similar argument for the second term in (32), we get
[TABLE]
Hence,
[TABLE]
*The proof is completed by summing (30) over all edges , summing (33) over all triangles , and noting that and . *
Lemma 4.21**.**
For every ,
[TABLE]
Proof 4.22**.**
Let , so that
[TABLE]
As was shown in the proof of Lemma 4.19, we have
[TABLE]
where . Thus, if , then the trace inequality gives
[TABLE]
and similarly for edges on . On the other hand,
[TABLE]
*The conclusion follows from summing over all edges and all triangles . *
We will now finish the proof of Theorem 4.1. Taking and combining Propositions 4.14, 4.16, and 4.18 with the inverse estimate , the stability estimate , and the upper bound , we obtain
[TABLE]
Taking the supremum over and rearranging gives
[TABLE]
Since we have assumed that , we may divide by for sufficiently small to arrive at the -estimate in (16).
To obtain the -estimate in (16), observe that for any , we have
[TABLE]
Now since
[TABLE]
we deduce that
[TABLE]
Invoking the -estimate in (16) gives
[TABLE]
Next, assume , let , and let be the Scott-Zhang interpolant of . Then, using standard inverse estimates and interpolation error estimates, we obtain
[TABLE]
for each . Combining this with the -estimate (34) gives (17). This completes the proof of Theorem 4.1.
5 Numerical Examples
In this section, we present numerical experiments to illustrate the convergence rates predicted by Theorem 4.1. We focus on the -error, which, upon taking and in (17), satisfies
[TABLE]
assuming that , , and is taken equal to a suitable interpolant of [24, Theorem 2.6].
In our numerical implementation, we took equal to a subdivision-based interpolant of defined as follows. For each , let be the triangles formed by partitioning along the lines given in barycentric coordinates by , , , as depicted in Figure 2. Let be the union of the edges of . Let . For each , let denote the midpoint of . It is known that the linear functionals
[TABLE]
form a basis for the dual of , where is a unit vector (relative to the Euclidean metric) tangent to [24, pp. 38-39]. Let denote the basis for dual to these functionals:
[TABLE]
We took
[TABLE]
Table 1 shows the errors for the metric (1) on . We computed the discrete Gaussian curvature using Definition 3.1 with and on triangulations with maximum element diameter . We constructed each triangulation by randomly perturbing the interior vertices of a uniform triangulation of , as depicted in Figure 1a. Observe that the -error converges linearly when and does not converge when , in agreement with the estimate (35).
Acknowledgements
I am grateful to Melvin Leok for many helpful discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. M. Alsing, J. R. Mc Donald, and W. A. Miller , The simplicial Ricci tensor , Classical and Quantum Gravity, 28 (2011), p. 155007.
- 2[2] D. N. Arnold and F. Brezzi , Mixed and nonconforming finite element methods: Implementation, postprocessing and error estimates , ESAIM: Mathematical Modelling and Numerical Analysis, 19 (1985), pp. 7–32.
- 3[3] I. Babuška, J. Osborn, and J. Pitkäranta , Analysis of mixed methods using mesh dependent norms , Mathematics of Computation, 35 (1980), pp. 1039–1062.
- 4[4] E. Bänsch, P. Morin, and R. H. Nochetto , Surface diffusion of graphs: Variational formulation, error analysis, and simulation , SIAM Journal on Numerical Analysis, 42 (2004), pp. 773–799.
- 5[5] V. Borrelli, F. Cazals, and J.-M. Morvan , On the angular defect of triangulations and the pointwise approximation of curvatures , Computer Aided Geometric Design, 20 (2003), pp. 319–341.
- 6[6] S. Brenner and R. Scott , The mathematical theory of finite element methods , vol. 15, Springer Science & Business Media, 2007.
- 7[7] F. Brezzi and P.-A. Raviart , Mixed finite element methods for 4th order elliptic equations , in Topics in Numerical Analysis, III, Academic Press, London, 1977, pp. 33–56.
- 8[8] J. Cheeger, W. Müller, and R. Schrader , On the curvature of piecewise flat spaces , Communications in Mathematical Physics, 92 (1984), pp. 405–454.
