Abstract
It is common practice in science and engineering to approximate smooth surfaces and their geometric properties by using triangle meshes with vertices on the surface. Here, we study the approximation of the Gaussian curvature through the Gauss–Bonnet scheme. In this scheme, the Gaussian curvature at a vertex on the surface is approximated by the quotient of the angular defect and the area of the Voronoi region. The Voronoi region is the subset of the mesh that contains all points that are closer to the vertex than to any other vertex. Numerical error analyses suggest that the Gauss–Bonnet scheme always converges with quadratic convergence speed. However, the general validity of this conclusion remains uncertain. We perform an analytical error analysis on the Gauss–Bonnet scheme. Under certain conditions on the mesh, we derive the convergence speed of the Gauss–Bonnet scheme as a function of the maximal distance between the vertices. We show that the conditions are sufficient and necessary for a linear convergence speed. For the special case of locally spherical surfaces, we find a better convergence speed under weaker conditions. Furthermore, our analysis shows that the Gauss–Bonnet scheme, while generally efficient and effective, can give erroneous results in some specific cases.
1. Introduction
Many applications in science and engineering use discrete point sets for the approximation of surfaces of three-dimensional objects. A key challenge that subsequently arises is estimating the curvature of these surfaces given the mesh of surface data points. Hence, a fast and accurate approximation method is frequently desired. In this work, we address the common Gauss–Bonnet scheme, which is also called angular deficit scheme, for approximating the Gaussian curvature of smooth surfaces. The scheme is formula based and, hence, exhibits a fast computation time []. In addition, upon numerical analysis and a comparison with four other popular approaches, it is suggested to be the best-suited algorithm for the Gaussian curvature []. Other approaches include curve-fitting techniques and the methods by Watanabe and Belyaev [] and Taubin []. An overview of common methods for the approximation of the Gaussian curvature, but also other surface curvature definitions, is given in [].
Given a triangle mesh spanned by the surface data points, the Gauss–Bonnet scheme determines the Gaussian curvature by dividing the angular defect in a vertex p through a suitable area. Common choices for this area are either one-third of the areas of the attached triangles or the area closer to p than to the other vertices. We investigate here the latter, known as the Voronoi region. There are many ways to define the accuracy or goodness of this approximation. We parametrize the estimation error in terms of the maximum length of any edge in the star of p. While the Gauss–Bonnet scheme is highly accurate in various examples and even shows a quadratic convergence speed in numerical investigations [,,], an analytic error analysis is rare. For a regular set of data points, an analysis was done by [,,]. Xu [] also proved the convergence of the scheme under weaker assumptions. However, it has been observed that the convergence depends on the uniformity of the mesh [,]. We will support these findings by showing that a control of the mesh is necessary for ensuring a convergence of the scheme.
This paper builds on the work of Borrelli, Cazals, and Morvan [] and performs an error analysis based on the convergence of the angles of Euclidean triangles towards the angles of geodesic triangles with the same vertices. We define conditions on the data points of a smooth surface that are sufficient and also necessary for the convergence of the scheme. We first control the angles of the Euclidean triangles and, second, their relative edge lengths. For these cases, we prove a linear convergence speed of the scheme. Furthermore, we improve the estimation of the convergence speed for locally spherical surfaces. By this, we conclude that the Gauss–Bonnet scheme provides a good approximation of the Gaussian curvature if one controls the mesh, but suffers from a possible high inaccuracy otherwise.
In our work, we first define in Section 2 some background notations and give in Section 3 a brief reminder of the Gauss–Bonnet scheme. In Section 4, we summarize the preliminary work and evaluate our new estimations for acute triangles, triangles with preconditioned edge lengths, and the special case of locally spherical surfaces.
2. Basic Notations
We adapt the notations used in [], which we briefly recall in this section. See [] for more details concerning the fundamental differential geometry of surfaces.
Let S be a smooth surface in and let p be a point of S. Let be the set of the one-ring neighbor points of p, i.e., the numbered direct neighbor points. Their position with respect to p is defined by the polar angles and . The surface normal vector in p, , and span a plane . Hence, it is oriented by the angle with respect to the coordinate system (see Figure 1). The angle between and is denoted by , i.e., . Adding theses angles up, we describe a full round trip and, hence, . We write for the curvature of the plane curve in p.

Figure 1.
Definition of point in spherical coordinates and the position of the plane in relation to p and . Thereby, the angle describes the tilt of the plain around the normal vector and the position of the point in to the plain spanned by the other two axes of the coordinate system. The angle defines the position of with respect to the latter plain.
The Gauss–Bonnet scheme requires the approximation of S by a set of triangles, i.e., the mesh, whose vertices are defined through the given data points. Then, the set , , of n Euclidean triangles forms a piecewise linear approximation of S around p. For each triangle, let denote the angle and the Euclidean distance between p and (see Figure 2). Note that, in general, , and hence, . The difference is called the angular defect at p.

Figure 2.
Description of the Euclidean and geodesic triangles . The points and belong to the one-ring neighbor points of p. Their Euclidean distance to p is given by and .
3. The Gauss–Bonnet Scheme
The central quantity we address in this paper is the Gaussian curvature . It is defined as the product of the principal curvatures (maximum normal curvature) and (minimum normal curvature), []. The angular defect in a surface point divided by a suitable area provides a good approximation of the Gaussian curvature. This can be motivated as follows: In the case of triangulated surfaces, the Gauss–Bonnet theorem [] is reduced to
where R denotes an appropriate region of the mesh around p with a piecewise linear boundary. We take the surface integral over []. Assuming to be constant in R, we rewrite (1) as
with area of R. In the literature, the region R is often selected as a third of the area of the triangles [,]. Another popular choice of R is the region of the mesh that is closer to p than to its neighbors . This region is called the Voronoi region or the module of the mesh at p, and can be computed as follows:
Plugging this into Equation (2), we get
In the following, we refer to (4) as the Gauss–Bonnet scheme.
Note that the summands of (3) are not necessarily greater than zero. This condition is automatically fulfilled for acute triangles. Let and be the angles of the Euclidean triangles that are attached to the vertex points and , i.e., and . Applying the laws of sines and cosines, we can rewrite (3) as
Here, and denote the angles opposite to the edge of length . Although this equation describes the Voronoi region only for acute triangles, it is more commonly used in the literature, and [,,] build their error analysis on it.
Our work refers to their results of Borrelli, Cazals, and Morvan [], who evaluate the approximation of the Gaussian curvature (4) in a different way. We discuss their approach in the next section.
4. Error Analysis
We want to estimate the convergence speed of the Gauss–Bonnet scheme. While numerical error analysis indicates that this scheme has a quadratic convergence speed [], an analytical error analysis has only been performed for special cases [,,,]. One analytical approach is given by Borrelli, Cazals, and Morvan in []. They evaluate an upper limit for the Gauss–Bonnet scheme depending on the differences between the principal curvatures and . Building on their work, we determine conditions on the data points for a convergence of the Gauss–Bonnet scheme and prove that the convergence speed is faster for locally spherical surfaces. Special attention is devoted to the absolute value of that must be non-zero.
4.1. Preliminary Work
Before we can state and prove our theorems, we need some preliminary work. For convenience, we report the relevant material from [] without proofs, thus making our exposition self-contained.
Let c be a smooth regular curve and let p be a point in c. Then, we can represent c locally with the graph of a smooth function f, such that and the tangent to c is aligned with the x-axis. With and , we have, near the origin,
In order to approximate the curvature of c in p, we use polar coordinates , and evaluate an expression of as a function of .
Proposition 1.
Let be a smooth regular function with and . For a point on the graph of f, near the origin, one has
Moreover, we will make use of a dependency relationship between , and . Therefore, we consider fixed normal sections .
Proposition 2.
Let . Define the following sum and product functions:
The , and quantities satisfy
For convenience, we define the following auxiliary functions.
Definition 1.
Consider the one-ring neighbors of p. For the sake of conciseness, let , , and define the following quantities:
Thus, with , , and .
It can be shown that the Voronoi region is independent on the angles (see []).
Using this, we can now formulate the relevant proposition of this work. Stating that the angular defect is a homogeneous polynomial of degree two in the principal curvatures, Proposition 3 will be used throughout the following proofs.
Proposition 3.
Let . The angular defect and the principal curvatures satisfy
Based on this preliminary work, we present our main results in the next subsections.
4.2. Acute Triangles
The subsequent Theorem 1 provides an upper bound for the discrepancy between the Gauss–Bonnet scheme (4) and the Gaussian curvature for acute triangles. It easily can be shown that the Voronoi region is greater than zero under these conditions.
Theorem 1.
Let be a sequence of meshes on a smooth surface with p as a common vertex. Consider the one-ring around p. Let . Suppose that:
- There exists a positive constant such that .
- There exist two positive constants such that .
For , there exists a positive constant such that
depends on the angle and the length ratio , which are constant and given through the sequence of meshes.
For , it is
Proof.
Here, we evaluate the given inequalities on the basis of the proof in [] and provide an indication of how to estimate . It is sufficient to give the proof for a particular mesh in the sequence. For the sake of clarity, we omit its index m. Using Proposition 3, we first estimate the difference .
To express the inequality (17) in terms of and , we have to find upper and lower bounds for the auxiliary functions B and C. For acute triangles, i.e., , one has . Hence, with , we have
Therefore,
Similarly, we find the lower bound of B.
Therefore
Combining the upper and lower bounds of B, we get
Analogously, we find the same bounds for C. That gives
Substituting this result into (17) yields
Since , we can normalize (24) with . It follows that
We are left with the task of determining . For this purpose, we use (5) to find a lower bound of . We have
It follows from easy calculations that the right-hand side of (26) is minimal for , and therefore,
We can estimate as follows:
4.3. Triangles with Preconditioned Edge Lengths
While assuming that the angles of the Euclidean triangles spanned by are acute, we make sure that . In the same manner, we formulate preconditions on the distances to achieve positive summands of , and hence, .
Proposition 4.
Let be as defined above. Write and , and suppose that:
- There exists a positive constant such that for all i.
- There exist positive constants and such that for all i.
If or , then .
Proof.
The basic idea of the proof is to determine conditions on the distances such that the terms are greater than zero. If is greater than zero for all i, then is greater than zero.
First, we consider the case that , i.e., . It follows by simple analysis that for . We generalize this condition by demanding that for all i. Hence, and . By rearranging the terms, we get .
In the case , we have . Hence, it is easily seen that must be positive. This completes the proof. □
In the next theorem, we establish the upper bound of the normalized angular defect for data points with preconditioned distances.
Theorem 2.
Let be a sequence of meshes on a smooth surface with p as a common vertex. Consider the one-ring around p. Let . Suppose that:
- There exists a positive constant such that .
- There exists a positive constant such that .
- There exist positive constants and such that and , if .
For , there exists a positive constant such that
depends on the angle and the length ratio , which are constant and given by the sequence of meshes.
For , it is
Proof.
The proof follows the same line as the proof of Theorem 1. Again, we consider a particular mesh in the sequence and omit its index m. First, we can estimate as in (17). By determining the upper and lower bounds of B, we have to take into account that is not necessarily positive.
This yields
In the same manner, we find the lower bound of B.
Therefore,
Likewise, we get identical bounds for C. This gives
We proceed analogously to the proof of Theorem 1 by substituting this result in (17)
By Proposition 4, we know that must be positive. Thus, normalizing (39) by gives
As before, we are left with the task of determining . Therefore, we are looking for a lower bound of . From easy calculations, it follows that is minimal either for or for . Let us compare these cases by analyzing the respective differences of . This way, we evaluate the conditions under which one of these cases becomes minimal. Since , the expression
is zero if and only if is equal to 1 (i.e., ) or . Moreover, the derivative of (41) with respect to is positive for and negative for . From this, we get a lower bound for and, subsequently, for .
Now, we proceed analogously to the proof of Theorem 1. □
4.4. Sphere
In Section 4.2 and Section 4.3, we provided a convergence speed of the Gauss–Bonnet scheme for arbitrary smooth surfaces. Now, we alter the above theory for locally spherical surfaces, i.e., , and estimate a faster convergence speed. Therefore, we first have to revise the propositions in Section 4.1 for this special case.
Theorem 3.
Let S be a smooth surface that is locally spherical in . Let be a sequence of meshes on S with p as a common vertex. Consider the one-ring around p. Let . If for all m, then
Proof.
First, we prove that
Therefore, we define a coordinate system such that p is placed in the origin and is identical to the north pole of the sphere. Let the one-ring neighbors be placed on the northern hemisphere. Analogously to the proof of Proposition 2 in [], we get the equality
through comparison of the expressions of the dot product in spherical coordinates. Since is a plane curve, we can apply Proposition 1 to express as a function of . For a sphere, is zero, and hence,
Thus, we can rewrite (47) as
Applying the same arguments as the authors in [] gives (46). We proceed to insert (46) into the left-hand side of (14) and get, again analogously to the proof in [],
Since we are dealing with a locally spherical surface, we have . Hence, with , we get
4.5. Counterexample
In the above analysis, we formulated conditions on the mesh for a convergence of the Gauss–Bonnet scheme. When applying this method, we divide the angular defect by the Voronoi region of point p. Hence, must not become zero.
Here, we construct an example showing that the scheme fails when the conditions are not fulfilled. Let be six one-ring neighbors of p spanning Euclidean triangles with identical angles in p and alternating lengths, i.e., for all , for , and for all . This example does not fulfill the third condition of Theorem 2, since . Furthermore, the angles of the spanned Euclidean triangles in the neighbor points of the short edges, i.e., , are not acute, and thus contradict the first condition of Theorem 1. Inserting these numbers into (3), we get . Hence, the scheme does not converge.
5. Conclusions
In this work, we derived necessary conditions for the convergence of the Gauss–Bonnet scheme for an arbitrary mesh of data points of a smooth surface. Under these conditions, we proved a linear convergence speed in general and quadratic convergence speed in the special case of locally spherical surfaces. We also showed that the Gauss–Bonnet scheme does not always provide an accurate estimate of the Gaussian curvature. The scheme can even diverge if the conditions are not satisfied. Thus, the Gauss–Bonnet scheme should be used for estimating the Gaussian curvature at a vertex only when one can control the mesh. In particular, it is necessary to guarantee that the Voronoi region of the vertex does not become zero.
In our analysis, we did not consider the vertex points to be erroneous due to sensing noises [,]. However, we think that an error analysis for noisy data is possible with the methods presented above.
Funding
The author gratefully acknowledges support by the Deutsches Zentrum für Luft- und Raumfahrt (DLR) with funding from the Bundesministerium für Wirtschaft und Technologie (FKZ 50OQ1801). Furthermore, the author gratefully acknowledges the funding of the Clusters of Excellence PhoenixD (EXC-2122, Project ID 390833453) and Quantum Frontiers (EXC-2123, Project ID 390837967) funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy.
Acknowledgments
The work presented here builds on the author’s master thesis submitted in 2017 at the Friedrich Schiller University Jena. Therefore, the author would like to thank Gerhard Zumbusch and Joachim Giesen for their supervision and useful discussions.
Conflicts of Interest
The author declares no conflict of interest.
References
- Magid, E.; Soldea, O.; Rivlin, E. A comparison of Gaussian and mean curvature estimation methods on triangular meshes of range image data. Comput. Vis. Image Underst. 2007, 107, 139–159. [Google Scholar] [CrossRef]
- Surazhsky, T.; Magid, E.; Soldea, O.; Elber, G.; Rivlin, E. A comparison of Gaussian and mean curvature estimation methods on triangular meshes. In Proceedings of the 2003 IEEE International Conference on Robotics and Automation, Taipei, Taiwan, 14–19 September 2003; Volume 1, pp. 1021–1026. [Google Scholar]
- Watanabe, K.; Belyaev, A. Detection of salient curvature features on polygonal surfaces. Eurographics 2001, 20, 53. [Google Scholar] [CrossRef]
- Taubin, G. A signal processing approach to fair surface design. Comput. Graph. 1995, 29, 351–358. [Google Scholar]
- Gatzke, T.D.; Grimm, C.M. Estimating curvature on triangular meshes. Int. J. Shape Model. 2006, 12, 1–28. [Google Scholar] [CrossRef]
- Borrelli, V.; Cazals, F.; Morvan, J.M. On the angular defect on triangulations and the pointwise approximation of curvatures. Comput. Aided Geom. Des. 2003, 20, 319–341. [Google Scholar] [CrossRef]
- Meek, D.S.; Walton, D.J. On surface normal an Gaussian curvature approximations given data sampled from a smoth surface. Comput. Aided Geom. Des. 2000, 17, 521–543. [Google Scholar] [CrossRef]
- Xu, G. Convergence analysis of a discretization scheme for Gaussian curvature over triangular surfaces. Comput. Aided Geom. Des. 2006, 23, 193–207. [Google Scholar] [CrossRef]
- Xu, Z.; Xu, G. Discrete schemes for Gaussian curvature and their convergence. Comput. Math. Appl. 2009, 57, 1187–1195. [Google Scholar] [CrossRef][Green Version]
- Do Carmo, M.P. Differential Geometry of Curves and Surfaces; Prentice-Hall, Inc.: Englewood Cliffs, NJ, USA, 1976. [Google Scholar]
- Meyer, M.; Desbrun, M.; Schröder, P.; Barr, A.H. Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and Mathematics III; Springer: Berlin/Heidelberg, Germany, 2003; pp. 35–57. [Google Scholar]
- Pottmann, H.; Wallner, J.; Huang, Q.X.; Yang, Y.L. Integral invariants for robust geometry processing. Comput. Aided Geom. Des. 2009, 26, 37–60. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).