Approximate Mean Curvature Vector
- Approximate Mean Curvature Vector is defined as techniques for recovering the extrinsic curvature vector from indirect representations like point clouds, triangulated meshes, and volumetric discretizations.
- It encompasses diverse approaches including discrete cotangent formulas, kernel-regularized varifold methods, and stabilized finite-element strategies that address normalization and sign ambiguities.
- These methods provide practical insights for geometric flow simulations and curvature-driven evolution in both smooth and nonsmooth, anisotropic, or high-dimensional contexts.
In the literature surveyed here, the expression approximate mean curvature vector denotes a family of constructions for recovering, estimating, or evolving the extrinsic mean curvature vector when the underlying geometry is available only through local boundary data, triangulated meshes, point clouds, volumetric discretizations, smoothings of nonsmooth sets, or other indirect representations. The common target is the vector quantity that, in smooth Euclidean geometry, is normal to the surface and is represented by conventions such as , , , or , depending on normalization and sign. Taken together, the cited works indicate that no single standardized definition dominates across all settings: some constructions are exact in the smooth limit, some are discrete analogues on meshes, some are kernel-regularized varifold quantities, and some papers use only scalar or indirectly reconstructed vector surrogates (Grinfeld, 2011).
1. Terminological scope and competing meanings
The phrase does not denote one universally fixed object. In the varifold framework, an approximate mean curvature vector is defined by regularizing both the first variation and the mass, then taking a normalized ratio; this makes sense for arbitrary varifolds, including point clouds and volumetric discretizations, and converges to generalized mean curvature under appropriate assumptions (Buet et al., 2016). In triangulated-surface papers, the same phrase often refers instead to a vertex-based discrete vector built from opposite-edge normals, cotangent weights, or stabilized finite-element solves on piecewise linear meshes (Das et al., 2019). In smoothing constructions for convex polytopes, by contrast, the emphasis is overwhelmingly on the scalar mean curvature of smooth approximating hypersurfaces , with the corresponding vector interpretation left heuristic rather than formalized as weak convergence of vector-valued measures (2207.13346).
Other works depart even further from a literal vector-valued meaning. In the crystalline-anisotropic setting, the relevant generalized curvature is the scalar divergence of a Cahn–Hoffman field, canonically selected as the minimal -divergence; the vector object is the Cahn–Hoffman field itself, not a Euclidean mean curvature vector in the standard sense (Giga et al., 2017). In high-dimensional data analysis, the computed quantity may be only a nonnegative scalar score , explicitly not a full signed differential-geometric vector (Levada, 4 Jun 2026). A persistent source of confusion is therefore terminological: some papers approximate the full vector, some approximate a scalar that determines the vector once a normal is known, and some approximate only a magnitude-like surrogate.
A second ambiguity is convention. For smooth surfaces, the same geometric object appears as , , 0, or 1, depending on whether 2 is the sum or average of principal curvatures and on the sign chosen for the normal and Laplace–Beltrami operator (Grinfeld, 2011). This suggests that vector-valued formulations are often preferred because they avoid the scalar sign and factor-of-two ambiguities that recur across geometric analysis and discrete differential geometry.
2. Smooth geometric prototypes and exact limiting identities
A particularly compact smooth prototype is the contour identity for a regular patch 3 with smooth boundary 4: 5 Here 6 is the unit surface normal, 7 is the outward unit normal to the boundary curve within the surface, and 8 is the trace of the second fundamental form. Shrinking the patch gives the pointwise formula
9
The identity is exact for smooth patches, and the pointwise value is exact as a limit. Its derivation is a surface-divergence argument based on
0
with 1 (Grinfeld, 2011).
This formula is important because it expresses an extrinsic curvature vector through boundary data alone. The paper also emphasizes that 2 is more fundamental than separating normal and scalar curvature, precisely because conventions differ. Under the convention 3 with 4, one has 5 up to sign. Under Laplace–Beltrami conventions such as 6, the same contour average recovers the corresponding signed vector (Grinfeld, 2011).
The contour identity also yields a boundary characterization of minimality: 7 for any contour 8 lying in a minimal surface, since 9 there (Grinfeld, 2011). A plausible implication is that many discrete formulas based on summing local in-surface normals can be read as direct descendants of this exact smooth statement rather than as ad hoc estimators.
3. Triangulated surfaces, cotangent formulas, and stabilized finite elements
On triangulated meshes, one widely used approximation is the vertex formula
0
where the sum is over triangles 1 incident on vertex 2, 3 is the length of the edge opposite 4, 5 is the outward edge-perpendicular unit vector in the triangle plane, and 6 is the modified Voronoi area. The same paper shows that this physics-based force-balance derivation is algebraically identical to the cotangent Laplace–Beltrami formula
7
and identifies the computed quantity as 8, not 9, under its conventions (Das et al., 2019).
A more geometric one-ring formula appears in the contour-based note: if triangles 0 meet at a vertex 1, with opposite edge lengths 2, triangle areas 3, and in-triangle outward normals 4 perpendicular to those opposite edges, then
5
is proposed as the discrete analogue of 6. The paper stresses that 7 should be interpreted as a discrete vector mean curvature, not as a normal estimator, because it vanishes on minimal or nearly minimal surfaces and is then directionally unreliable. It also states that 8 is the gradient of total area with respect to the vertex position, so 9 for minimal triangulated surfaces (Grinfeld, 2011).
For piecewise linear triangulated surfaces, several finite-element papers replace local formulas by global variational solves. One stabilized formulation defines 0 by
1
with an edge-jump stabilization
2
The key claim is that the unstabilized discrete Laplace–Beltrami approximation generally cannot be expected to converge in 3 on piecewise linear geometry, while the stabilized method yields
4
for smooth closed surfaces (Cenanovic et al., 2017). The related closed-surface and cut-surface formulation
5
proves the same first-order 6 estimate and, in the cut case, shows that face stabilization alone is sufficient (Hansbo et al., 2014).
These mesh-based approaches share a common structure: the approximate mean curvature vector is either a local sum of geometric edge contributions or a weak finite-element representation of the surface Laplacian of the embedding. This suggests that the principal divide inside discrete geometry is not between “local” and “global” methods, but between raw discretizations and structure-preserving ones that enforce area variation or stabilized weak consistency.
4. Kernel-regularized varifold approximations
In the varifold setting, the approximate mean curvature vector is defined for any 7-varifold 8 by regularizing the first variation and the mass with radial kernels 9. With
0
the central formula is
1
whenever 2. For rectifiable varifolds with locally bounded first variation,
3
and in the smooth 4 manifold case this limit is the classical mean curvature vector (Buet et al., 2016).
For point-cloud varifolds
5
the same construction becomes an explicit neighbor sum: 6 Because tangential artifacts can be induced by nonuniform sampling, the paper also defines the orthogonal approximate mean curvature by projecting onto the normal component. In the smooth-manifold case, this orthogonal version enjoys an improved error estimate of order
7
under the stated approximation assumptions (Buet et al., 2016).
A later generalization enlarges the class of admissible linear operators 8 in
9
Beyond the Buet–Rumpf choices, the paper proves that
0
while
1
and it extends the convergence theory from 2 hypersurfaces to 3-integral varifolds with unit density, 4 for 5, and 6 (Sagueni, 8 Sep 2025). This operator viewpoint suggests that approximate mean curvature can be understood not only as a kernel formula, but as a linear algebra of admissible ambient projections acting on the same regularized first-variation template.
5. Approximate curvature vectors in geometric flows
Several papers use approximate mean curvature vectors not merely as static estimators but as velocities in geometric evolution. One general-varifold construction fixes 7 and defines
8
The field 9 is then inserted into the explicit Euler push-forward map
0
and iterated to produce a time-discrete approximate mean curvature flow for arbitrary finite-mass varifolds, including point-cloud varifolds. For fixed 1, the time-discrete flows converge as 2 to a unique 3-approximate flow satisfying an exact Brakke-type identity and the mass dissipation formula
4
A closely related volumetric-varifold paper studies the approximate mean curvature
5
for cellwise constant-in-orientation volumetric discretizations
6
Its main result is an integral Brakke approximate equality with consistency defect
7
showing that the regularized curvature vector can replace the true mean curvature in a discretized flow law while retaining the correct dissipation structure up to explicit errors (Sagueni, 8 Sep 2025).
For surfaces with fixed boundary, the approximation is indirect. The semidiscrete scheme evolves a parametrized surface by
8
where 9 and 0 are separate discrete approximations of scalar mean curvature and unit normal. The continuous problem imposes the boundary conditions
1
together with a conormal derivative identity for 2. The paper proves optimal 3-error estimates of order 4 for 5 for 6, 7, 8, and 9, so 00 inherits the same order as an approximation of the mean curvature vector (Ivaniszyn et al., 25 Apr 2025).
For planar curves, an Onsager-principle discretization uses the polygonal length 01 and dissipation 02 to derive the nodal ODE
03
Here 04 is the discrete first variation of length and 05 is the discrete 06-gradient-flow velocity. The semidiscrete system preserves the exact discrete dissipation law
07
which identifies 08 as the paper’s discrete curvature-vector force (Liu et al., 2024).
6. Singular, polyhedral, anisotropic, and high-dimensional variants
Approximate mean curvature becomes more heterogeneous when the underlying geometry is nonsmooth or the ambient setting is nonclassical. For convex polytopes and mean convex manifolds with corners, smooth hypersurfaces 09 are constructed so that scalar mean curvature remains positive and the weighted boundary metric
10
recovers the polyhedral angular metric in the limit. The sharp local statement is that mean curvature on the smoothing graph blows up like 11 near codimension-two faces. The paper explicitly does not prove weak convergence of vector-valued mean curvature measures, but it strongly suggests a picture in which curvature concentrates near the 12-skeleton of the polytope (2207.13346).
In crystalline anisotropy, the approximation target is scalar from the outset. A facet is regularized not by assigning it a Euclidean mean curvature vector, but by producing a Cahn–Hoffman vector field 13 with 14, subordinate to the anisotropy through 15. The canonical generalized curvature is then
16
the minimal 17-divergence among admissible Cahn–Hoffman fields. Every bounded facet can be approximated by one admitting such a field, which makes generalized crystalline mean curvature available by approximation, but this remains a scalar theory rather than a Euclidean vector theory (Giga et al., 2017).
At the opposite end of the spectrum, high-dimensional data-manifold methods may discard direction entirely. One recent estimator computes
18
from a 19-nearest-neighbor covariance eigensystem, then reduces the cost from 20 to 21 by an exact algebraic identity and further to
22
by truncated SVD and a Haar-expectation approximation of null-space contributions. The paper explicitly states that this is not a full signed differential-geometric mean-curvature vector, but a scalar nonnegative local mean-curvature score (Levada, 4 Jun 2026).
A final misconception concerns normals. Because several discrete constructions actually approximate the product “curvature times normal,” not the normal alone, they become directionally unstable near minimality. The triangulated contour analogue makes this explicit: if the mean curvature vector is small, the construction cannot robustly determine a normal direction (Grinfeld, 2011). This suggests that in both classical and data-driven settings, vector-valued approximations are strongest when interpreted as curvature forces or first-variation densities, not as normal estimators detached from curvature magnitude.