Abstract 1 Introduction 2 Preliminaries 3 Vertex Decomposition for Convex Polytopes 4 Cauchy-Type Formulas for General Convex Bodies Concluding Remarks and Open Problems References

Cauchy’s Surface Area Formula in the Funk Geometry

Sunil Arya ORCID Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong    David M. Mount ORCID Department of Computer Science, University of Maryland, College Park, MD, USA
Abstract

Cauchy’s surface area formula expresses the surface area of a convex body as the average area of its orthogonal projections over all directions. While this tool is fundamental in Euclidean geometry, with applications ranging from geometric tomography to approximation theory, extensions to non-Euclidean settings remain less explored. In this paper, we establish an analog of Cauchy’s formula for the Funk geometry induced by a convex body K in ℝd, for the Holmes–Thompson surface area. The formula is based on central projections to boundary points of K. We show that when K is a convex polytope, the formula reduces to a weighted sum of contributions associated with the vertices of K. Finally, as a consequence of our analysis, we derive a generalization of Crofton’s formula for surface areas in the Funk geometry. By viewing Euclidean, Minkowski, Hilbert, and hyperbolic geometries as limiting or special cases of the Funk setting, our results provide a unified framework for these classical surface area formulas.

Keywords and phrases:
Convexity, Cauchy’s formula, Funk geometry, Hilbert geometry, Crofton’s formula, Holmes–Thompson surface area
Funding:
Sunil Arya: Research Grants Council of Hong Kong, China project number 16214721.
Copyright and License:
[Uncaptioned image] © Sunil Arya and David M. Mount; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Theory of computation → Computational geometry
Related Version:
Full Version: https://arxiv.org/abs/2601.16468 [9]
Editors:
Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri

1 Introduction

Cauchy’s surface area formula is a surprising and elegant result in Euclidean geometry. It states that the surface area of any convex body is a constant multiple of the average (d−1)-dimensional measure of its orthogonal projections, or “shadows”, taken over all possible directions. To state the result formally in any dimension d≥1, let Sd denote the d-dimensional unit sphere, λd denote the standard d-dimensional Lebesgue measure, ωd denote the volume of a d-dimensional Euclidean unit ball, and (⋅|⋅) denote orthogonal projection. Cauchy’s formula states that for any convex body K in ℝd, its surface area is

1ωd−1⁢∫Sd−1λd−1⁢(K|u⟂)⁢𝑑u, (1)

where u⟂ is the linear subspace orthogonal to u. The related Crofton formula allows us to express the surface area of a convex body K as the average number of lines that intersect K, assuming that the lines are sampled from an appropriate measure.

Cauchy’s formula is computationally fundamental, as it underpins algorithms in applications where estimating global geometric properties from lower-dimensional measurements is a recurring task, including geometric tomography [18], stereology [10], and surface area estimation for digitized 3D objects [24, 22]. Integral formulas of this form are the essential first steps in efficient sampling processes, such as computing ε-nets [3, 14], since they implicitly define the probability distribution upon which to base the sampling.

Modern applications have increasingly explored non-Euclidean spaces, such as the Hilbert geometry and its close relative, the Funk geometry. (See Section 2 for definitions.) These geometries arise naturally whenever the domain of interest is a convex set. Examples include the analysis of discrete probability distributions in machine learning, where the domain is the probability simplex [12, 25], analysis of networks through hyperbolic geometry [21], analysis of positive definite matrices in deep learning [20, 23], and lattice-based cryptosystems [8]. Hilbert is more widely studied than Funk, but Faifman argues that for many applications, including computing volumes and areas, the Funk geometry is more natural and yields cleaner results [16].

While the metric properties of these spaces are well-understood in differential geometry [16, 26, 27], computational aspects of these geometries are only beginning to emerge. Recent work has employed the Hilbert geometry for polytope approximation [7, 8], clustering [25], and approximate membership queries [2]. Despite this growing algorithmic interest, the integral geometry of these spaces lacks the computational primitives required for efficient implementations. A major barrier is that the standard definition of surface area (the Holmes–Thompson area [19]) relies on symplectic forms or global integrals involving the polar body, making direct numerical evaluation prohibitively complex for high-dimensional or large-scale settings.

In this paper, we bridge this gap by establishing explicit Cauchy and Crofton formulas for the Funk geometry. Our formulas transform the abstract definitions of Finsler area into simple, concrete geometric quantities, which are readily accessible to discrete computation. Beyond the specific interest in Funk geometry, our results reveal it as a unifying bridge connecting diverse geometric settings.

Our main result is a Funk analog of Cauchy’s formula. Let K be a convex body in ℝd, and let G be a convex set contained in the interior of K. Our objective is to compute the Holmes–Thompson surface area of G in the Funk geometry induced by K, which we denote by areaKF⁡(G). For simplicity, let us assume for now that K’s boundary is strictly convex, implying that for each direction u∈Sd−1, there is a unique boundary point vK⁢(u) whose supporting hyperplane is orthogonal to u (see Figure 1(a)). Define the central shadow SK⁢(G,u) as the slice of the cone subtended by G at vK⁢(u), orthogonal to the direction u:

SK⁢(G,u)=−u∗∩cone⁡(G−vK⁢(u)),

where −u∗ is the hyperplane tangent to Sd−1 at −u and cone⁡(G−vK⁢(u)) is the translation of the subtended cone to the origin (see Figure 1(b)). The measure of this section captures the “visual size” of G as seen from the boundary point vK⁢(u). Just as the Euclidean formula averages orthogonal shadows, our Funk formula averages these central shadows. We show that G’s surface area is proportional to the average area of these shadows, taken over all directions u.

Figure 1: (a) The boundary point vK⁢(u), (b) the central shadow SK⁢(G,u) (translated so that vK⁢(u) coincides with the origin), and (c) vertex decomposition.
Theorem 1.1.

Let G and K be two convex bodies in ℝd such that G⊂int⁡(K). Then

areaKF⁡(G)=1ωd−1⁢∫Sd−1λd−1⁢(SK⁢(G,u))⁢𝑑σ⁢(u),

where σ denotes the rotation-invariant surface measure on Sd−1.

This offers a “tomographic interpretation” in the sense that the intrinsic Funk surface area can be recovered solely from these central slices, which capture the visibility of G from the boundary of K. It is interesting to note that, while the Holmes–Thompson surface area of G (presented in Section 2.2) is defined in terms of the areas of the polars of Finsler balls in the Funk geometry induced by K, the formula of Theorem 1.1 involves only simple Euclidean quantities and the standard Lebesgue measure.

Our formulation connects the Funk geometry to several classical settings. When K is expanded to infinity, the central shadows become parallel projections, and our result converges to a Cauchy-type formula for the surface area in Minkowski spaces. In the special case where K is a Euclidean ball, this limit yields the classical Euclidean Cauchy formula. Furthermore, for a finite Euclidean ball K, our formula yields the exact surface area in the Beltrami-Klein model of hyperbolic geometry [13], generalizing planar observations by Alexander et al. [5]. Finally, for arbitrary convex bodies, our Funk surface area serves as a constant-factor approximation for the Hilbert surface area, with factors depending only on the dimension d. These results have been omitted due to space restrictions, but they appear in the full version of the paper [9].

Crucially for algorithmic applications, we derive a discrete surface area formula when K is a polytope. We show that the Funk surface area of a body G nested within K can be decomposed into a sum of local terms associated with the vertices of K. Each vertex v of K is naturally associated with a pointed cone Kv=cone⁡(K−v), which is the cone subtended by K after translating v to the origin (see Figure 1(c)). The body G is similarly associated with a cone Gv=cone⁡(G−v). In Section 2.3, we define a simple shadow-based notion of the Funk volume of Gv with respect to Kv, which we denote by volKvF⁡(Gv). We show that the total surface area of G can be expressed as the sum of these cone-based Funk volumes over the vertices of K.

Theorem 1.2 (Vertex Decomposition for Polytopes).

Let K be a convex polytope in ℝd, and let G⊂int⁡(K) be a convex body. For each vertex v∈V⁢(K), let Kv=cone⁡(K−v) and Gv=cone⁡(G−v). Then

areaKF⁡(G)=∑v∈V⁢(K)volKvF⁡(Gv).

While the cone-based Funk volume defined in Section 2.3 involves integration, it can be readily estimated through random sampling. Furthermore, this decomposition scales linearly with the vertex count of K (see the discussion following the proof of Theorem 1.1 in Section 4). This is in contrast to prior Crofton measures for Hilbert geometries, which involve quadratic enumerations over face pairs [30].

Finally, we establish a Funk–Crofton formula (Theorem 4.4), expressing the Funk surface area as the K-dependent measure of the set of line parameters whose associated lines intersect the body. This result provides the basis for Monte-Carlo estimation of surface area, similar to methods used in Euclidean geometry [1, 22]. That is, one can approximate the Funk surface area simply by sampling from the associated parameter distribution and counting intersections of the corresponding lines with the body, bypassing the need for complex analytical evaluation.

1.1 Related Work

The study of integral geometry in projective Finsler spaces has a rich history in differential geometry [6, 29, 31]. Schneider [29] established the existence of Crofton measures for general projective Finsler spaces using the dual Holmes–Thompson volume. For the specific case of polytopal Hilbert geometries, he derived an explicit Crofton measure involving a combinatorial decomposition over pairs of complementary faces of the polytope [30]. Our work differs by focusing on Funk geometry and providing a decomposition based on the vertices of the ambient polytope, which as noted above offers significant computational advantages.

In the planar setting, Alexander [4] and later Alexander, Berg, and Foote [5] derived elegant Cauchy-type perimeter formulas for the Hilbert geometry using trigonometric integrals. Note that in this case, Hilbert and Funk surface areas coincide. Like ours, their formulas are explicit and admit a shadow interpretation in the Beltrami-Klein disk model of hyperbolic geometry. However, their techniques are specialized to the plane and do not seem to extend to arbitrary convex domains in higher dimensions. In contrast, our approach unifies these perspectives by showing that the “average of shadows” principle holds for general convex bodies in any dimension, with integrands that are directly interpretable as measures of central projections.

2 Preliminaries

Let us begin by presenting notation and terminology that will be used throughout the paper. We use ⟨⋅,⋅⟩ for the standard inner (dot) product on ℝd, and ∥⋅∥=⟨⋅,⋅⟩ for the Euclidean norm. Let O denote the origin, let Bd be the Euclidean unit ball centered at O, and let Sd−1=∂Bd be the unit sphere. Given a linear subspace E⊂ℝd and a set K⊂ℝd, let K|E denote the orthogonal projection of K onto E.

A convex body in ℝd is a compact convex set with nonempty interior. Given a convex set K, we denote its boundary and interior by ∂K and int⁡(K), respectively. For α≥0, α⁢K denotes the dilation of K by factor α about the origin, and for x∈ℝd, K+x denotes the translate of K by x. Given a convex body K and a direction u∈Sd−1, the support function of K is hK⁢(u)=sup{⟨u,x⟩:x∈K}, and the corresponding supporting hyperplane is

HK⁢(u)={x∈ℝd:⟨u,x⟩=hK⁢(u)}.

For 1≤k≤d, let λk denote the k-dimensional Hausdorff measure on ℝd. In particular, λd is the Lebesgue measure, and on any C1 k-dimensional submanifold of ℝd, λk agrees with the usual k-dimensional surface area. Let σ denote the standard rotation-invariant surface measure on Sd−1. Finally, let ωd=λd⁢(Bd).

Given two C1 hypersurfaces Φ,Ψ⊂ℝd and a differentiable map f:Φ→Ψ, the Jacobian of f at x∈Φ is the local area-stretch factor induced by the differential D⁢f⁢(x) on the tangent space of Φ at x. Equivalently, it is the factor appearing in the change-of-variables formula for surface integrals (see, for example, [15]).

Given two convex sets A,B⊂ℝd, their Minkowski sum is

A+B={a+b:a∈A,b∈B}.

Given a convex body K⊂ℝd, its difference body is

Δ⁢(K)=K+(−K),

which is centrally symmetric (see Figure 2(a)).

Figure 2: (a) The difference body of a convex body and (b) the polar of a convex body.

For any nonempty set K⊂ℝd, its polar, denoted K∘, is defined by

K∘={y∈ℝd:⟨x,y⟩≤1⁢ for all ⁢x∈K}

(see Figure 2(b)). The polar has several standard properties (see, for example, Barvinok [11]). It is always closed, convex, and contains the origin. If O∈int⁡(K), then K∘ is bounded. Moreover, if K is a convex body with O∈int⁡(K), then K∘ is also a convex body, and (K∘)∘=K. Finally, polarity reverses inclusion: if K1⊆K2, then K2∘⊆K1∘.

For a linear subspace E⊆ℝd and a nonempty set G⊆E, define the polar of G in E by

G∘E={y∈E:⟨x,y⟩≤1, for all x∈G}.

The next lemma is the standard duality between sections and projections, stated in the form needed later. A proof may be found in [33, Theorem 2.2.9 and Corollary 2.2.10].

Lemma 2.1 (Projection-Section Duality).

Let K⊆ℝd be a convex body such that O∈int⁡(K), and let E be a linear subspace of ℝd. Then the polar in E of the section K∩E equals the orthogonal projection of K∘ onto E. That is,

(K∩E)∘E=K∘|E.

2.1 The Funk and Hilbert Geometries

In this section, we introduce the Funk and Hilbert geometries and the related Finsler structures used to define volume and surface area. Let K be a convex body in ℝd. For any two distinct points x,y∈int⁡(K), let y′ denote the point where the ray directed from x through y intersects ∂K (see Figure 3(a)). The Funk distance with respect to K, denoted distKF⁡(⋅,⋅), is defined to be

distKF⁡(x,y)=ln⁡‖x−y′‖‖y−y′‖,

where distKF⁡(x,y)=0 if x=y. The Funk distance is nonnegative, asymmetric, satisfies the triangle inequality, and is invariant under invertible affine transformations [27]. Because of its asymmetry, this is often referred to as a weak metric or quasi-metric.

Figure 3: (a) The Funk distance and (b) the Hilbert distance.

The Hilbert distance with respect to K, denoted distKH⁡(⋅,⋅), is the symmetrization of the Funk distance. Letting x′ denote the point where the directed ray from y through x intersects ∂K, it is defined to be

distKH⁡(x,y)=12⁢(distKF⁡(x,y)+distKF⁡(y,x))=12⁢ln⁡‖y−x′‖‖x−x′‖⁢‖x−y′‖‖y−y′‖

(see Figure 3(b)). It is well known that this is a metric (symmetric, positive except when x=y, and satisfying the triangle inequality). Observe that the quantity in the logarithm is the cross ratio (x,y;y′,x′), and hence the Hilbert distance is invariant under invertible projective transformations.

Before defining volume and surface areas, let us first introduce some related concepts. Given a convex body D in ℝd with O∈int⁡(D) and u∈ℝd, the Minkowski functional (or gauge) induced by D is defined by

‖u‖D=inf{λ>0:u∈λ⁢D}.

This functional is positively homogeneous and subadditive. If D is centrally symmetric, then ∥⋅∥D is a norm in the usual sense; in general, it is the Minkowski functional (or gauge) of D. A Finsler metric on a manifold is a continuous function on its tangent bundle, whose restriction to each tangent space is such a gauge. It is well known that both the Funk and Hilbert geometries induce a Finsler structure [34].

To define the Finsler structure for Funk, consider any x∈int⁡(K). Identify the tangent space at x, denoted Tx, with ℝd. For each nonzero v∈Tx, let x+ denote the point where the ray emanating from x in direction v intersects ∂K (see Figure 4(a)), and let t be a positive scalar such that x+t⁢v=x+. The resulting Finsler gauge at x is defined as

FinslerKF⁡(x,v)=1tandFinslerKF⁡(x,0)= 0.

This defines a gauge whose unit ball, denoted BKF⁢(x), is K−x. Thus, the ball is just a translate of K such that x coincides with the origin.

Figure 4: (a) The Finsler structure and (b) the Finsler ball for Hilbert (recentered about x).

The Finsler structure for Hilbert is a symmetric variant of the Funk Finsler structure. For each x∈int⁡(K) and each nonzero vector v∈Tx, let x+ be as before, and let x− be the point where the ray emanating from x in direction −v intersects ∂K (see Figure 4(a)). Let t+ and t− be positive scalars such that x+t+⁢v=x+ and x−t−⁢v=x−. Then

FinslerKH⁡(x,v)=12⁢(1t++1t−)andFinslerKH⁡(x,0)= 0.

Since this gauge is symmetric, it is a norm. Its unit ball, denoted BKH⁢(x), is centrally symmetric (see Figure 4(b)). If K is a polytope, then so is BKH⁢(x).

The following lemma relates the polar of the Finsler ball in the Hilbert metric to the difference body of (K−x)∘. The lemma is a straightforward consequence of the Finsler interpretation of the Hilbert metric (see, e.g., [26, 31]).

Lemma 2.2.

Given a convex body K⊂ℝd and x∈int⁡(K), BKH⁢(x)∘=12⁢Δ⁢((K−x)∘).

2.2 Holmes–Thompson Volume and Surface Area

There are several ways to define volume and surface area in Finsler spaces. The volume of a subset G⊂int⁡(K) arises by integrating the weighted contributions of volume elements over G, where the weight of each element depends on the local geometry, as expressed through the Finsler ball. Intuitively, as the size of the Finsler ball decreases, the relative importance of the associated Lebesgue volume element increases. Due to the reciprocal nature of polarity, as the volume of the Finsler ball decreases, the volume of its polar increases. This gives rise to the following definitions, due to Holmes and Thompson [19].

Let us first consider the Funk geometry. Given a convex body K and x∈int⁡(K), the Holmes–Thompson volume element is obtained by scaling the Lebesgue volume element d⁢λd⁢(x) by the ratio of the Lebesgue volume of the polar of the Funk Finsler ball, λd⁢(BKF⁢(x)∘), and the Lebesgue volume of the unit Euclidean ball, ωd [17, 19]. Define the Funk volume element to be

d⁢volKF⁡(x)=1ωd⁢λd⁢(BKF⁢(x)∘)⁢d⁢λd⁢(x).

Recall that BKF⁢(x)=K−x. The Funk volume of any convex body G⊂int⁡(K) is

volKF⁡(G)=∫x∈Gd⁢volKF⁡(x).

The Holmes–Thompson surface area in the Funk geometry is defined analogously. At each smooth boundary point x∈∂G, let Tx denote the tangent space to ∂G at x, viewed as a linear subspace of ℝd and equipped with the induced Hausdorff measure. The Funk surface-area element is given by

d⁢areaKF⁡(x)=1ωd−1⁢λd−1⁢((BKF⁢(x)∩Tx)∘Tx)⁢d⁢λd−1⁢(x).

By Lemma 2.1, we can express this alternatively in terms of the projected polar as

d⁢areaKF⁡(x)=1ωd−1⁢λd−1⁢(BKF⁢(x)∘|Tx)⁢d⁢λd−1⁢(x).

Since BKF⁢(x)=K−x, this is exactly

d⁢areaKF⁡(x)=1ωd−1⁢λd−1⁢((K−x)∘|Tx)⁢d⁢λd−1⁢(x). (2)

The Funk surface area of G⊂int⁡(K) is

areaKF⁡(G)=∫x∈∂Gd⁢areaKF⁡(x).

The Holmes–Thompson volume and surface area in the Hilbert geometry are defined analogously, replacing the Funk Finsler ball BKF⁢(x) by the Hilbert Finsler ball BKH⁢(x). We denote the resulting quantities by volKH⁡(G) and areaKH⁡(G).

Faifman showed that the Hilbert- and Funk-based volumes and surface areas are related up to factors that depend on dimension.

Lemma 2.3 (Faifman [16]).

Let K⊂ℝd be a convex body, let G⊂int⁡(K) be a convex body, and let β⁢(d)=(2⁢dd)/2d. Then

volKF⁡(G) ≤volKH⁡(G)≤β⁢(d)⋅volKF⁡(G)and
areaKF⁡(G) ≤areaKH⁡(G)≤β⁢(d−1)⋅areaKF⁡(G).

2.3 Cones

The standard Cauchy formula relies on orthogonal projections. We shall see that in the context of the Funk geometry induced by a convex body, the appropriate generalization utilizes central projections towards the boundary of the body. Such projections naturally involve cones. Throughout this paper, a cone in ℝd denotes a full-dimensional convex set closed under positive scaling (i.e., if x is in the set, then λ⁢x is in the set for all λ≥0). We assume our cones are pointed, meaning that they contain no lines. This implies that each cone has a unique apex at the origin.

The conical hull of a convex set G⊂ℝd, denoted cone⁡(G), is the smallest cone containing G, that is,

cone⁡(G)={γ⁢x:x∈G⁢and⁢γ≥0}

(see Figure 5(a)). Let K⊂ℝd be a closed, full-dimensional convex set. For any boundary point v∈∂K, the normal cone at v consists of all outer normal vectors to K at v:

{u∈ℝd:⟨u,x−v⟩≤0,for all⁢x∈K}.

(see Figure 5(b)). In the cases of primary interest to us, such as when v is a vertex of a polytope or the apex of a pointed cone, the tangent cone Kv=cone⁡(K−v) is pointed. In these settings, the normal cone is full-dimensional and coincides with the polar cone Kv∘.

Figure 5: (a) The cone cone⁡(G), (b) the normal cone Kv∘, and (c) FK⁢(x).

For any nonzero vector z∈ℝd, we denote the associated dual hyperplane by

z∗={u∈ℝd:⟨u,z⟩=1}.

For a pointed cone K⊂ℝd and a vector x∈int⁡(K), we define the dual cross-section FK⁢(x) to be the intersection of the polar cone K∘ with the dual hyperplane associated with −x (see Figure 5(c)). That is,

FK(x):=K∘∩−x∗=K∘∩(−x)∗={y∈K∘:⟨x,y⟩=−1}. (3)

Geometrically, this is the slice of the polar cone by a hyperplane orthogonal to the direction x. Since x lies in the interior of K, and every vector in K∘ has nonpositive inner product with every vector in K, this hyperplane intersects K∘ in a bounded set.

Next, we establish a simple technical lemma relating the polar of a body to the polar of its subtended cones. This result allows us to characterize the facets of the polar polytope using local cone geometry.

Lemma 2.4.

Let Q⊂ℝd be a convex body containing the origin in its interior. Let v∈ℝd∖int⁡(Q). Let Qv=cone⁡(Q−v) be the cone subtended by Q at v (see Figure 6(a)). Then the intersection of the polar cone Qv∘ with the dual hyperplane v∗={y∈ℝd:⟨v,y⟩=1} coincides with the slice of the polar body Q∘ by v∗, that is, Qv∘∩v∗=Q∘∩v∗ (see Figure 6(b) and (c)).

Figure 6: (a) The cone Qv, (b) Qv∘∩v∗, and (c) Q∘∩v∗.

Proof.

By definition, a vector y∈Qv∘ if and only if ⟨z,y⟩≤0 for all z∈Qv. Since Qv is the conical hull of Q−v, this condition is equivalent to:

⟨x−v,y⟩≤ 0,∀x∈Q.

Restricting our attention to the hyperplane v∗, where ⟨v,y⟩=1, this inequality becomes:

⟨x,y⟩−⟨v,y⟩≤0⇔⟨x,y⟩−1≤0⇔⟨x,y⟩≤1,∀x∈Q.

The condition ⟨x,y⟩≤1 for all x∈Q is exactly the definition of the polar body Q∘. Thus, restricted to the hyperplane v∗, the condition for membership in the polar cone is identical to the condition for membership in the polar body. ◀

When applied to the vertices of a polytope, this lemma provides a functional characterization of the boundary of the polar body. Recall that for a polytope K with O∈int⁡(K), the facets of the polar body K∘ are in one-to-one correspondence with the vertex set V⁢(K) [35]. Specifically, for each vertex v∈V⁢(K), the dual facet is the intersection of K∘ with the supporting hyperplane v∗. Lemma 2.4 implies that this facet is exactly Kv∘∩v∗, which matches the definition of the dual cross-section FKv⁢(−v).

Corollary 2.5.

Let K⊂ℝd be a convex polytope with O∈int⁡(K). For each vertex v∈V⁢(K), the facet of K∘ dual to v, denoted Fv, is given by

Fv=Kv∘∩v∗=FKv⁢(−v).

Furthermore, ∂K∘=⋃v∈V⁢(K)Fv.

Extending the definition of Funk volume from bounded convex bodies to unbounded cones requires care. If G and K are pointed cones in ℝd with (G∖{O})⊂int⁡(K), the standard Funk distance is degenerate, and the classical volume is infinite. However, the projective nature of Funk geometry allows us to define a meaningful volume for G relative to K by considering cross-sections. Faifman [16] demonstrated that the Funk geometry is essentially projective. A key consequence is that the Holmes–Thompson volume of the section G∩H, measured with respect to the ambient section K∩H, is invariant to the choice of the hyperplane H, provided K∩H is bounded. We call such a hyperplane admissible.

This invariance implies that the volume is intrinsic to the nested cone structure itself. We define the cone Funk volume of G relative to K by the integral

volKF⁡(G):=1ωd−1⁢∫Σ⁢(G)λd−1⁢(FK⁢(s))⁢𝑑σ⁢(s),where Σ⁢(G):=Sd−1∩G (4)

(see Figure 7(a)). In the full version of the paper [9], we show that this integral coincides with volK∩HF⁡(G∩H) for any admissible hyperplane H, thus justifying this terminology.

Figure 7: (a) Defining volKF⁡(G) and (b) the gnomonic projection.

When dealing with spherical cross-sections of cones, it is useful to relate their spherical measures to the Euclidean measures of corresponding hyperplane sections. Let C⊂ℝd be a pointed cone, let Ω=C∩Sd−1, and let u∈Sd−1 satisfy ⟨x,u⟩<0 for all x∈Ω. The associated gnomonic projection maps Ω onto the hyperplane section −u∗∩C (see Figure 7(b)). A straightforward Jacobian computation yields the following lemma (see, e.g., [16, Lemma 3.10]).

Lemma 2.6 (Cone gnomonic projection).

Let C⊂ℝd be a pointed cone, let Ω=C∩Sd−1, and let u∈Sd−1 satisfy ⟨x,u⟩<0, for all x∈Ω (equivalently, u∈int⁡(C∘)). Define

Pu⁢(x):=−x⟨x,u⟩(x∈Ω).

Then Pu⁢(Ω)=−u∗∩C, and

λd−1⁢(Pu⁢(Ω))=∫Ω|⟨x,u⟩|−d⁢𝑑σ⁢(x).

3 Vertex Decomposition for Convex Polytopes

In this section, we establish a discrete surface area formula for the case where K is a convex polytope. Our result provides a vertex-based decomposition of the Funk surface area similar in spirit to that of Alexander et al. [5] in the planar Hilbert geometry, but derived by a distinct approach that applies in arbitrary dimensions.

Our proof proceeds by decomposing the Funk surface area of G into local contributions associated with the vertices of the ambient polytope K. For each vertex v∈V⁢(K), let Kv=cone⁡(K−v) and Gv=cone⁡(G−v) denote the local cones subtended at v. We will show that the total Funk surface area of G is the sum of the Funk volumes of the cones Gv relative to Kv. We begin with a lemma that expresses the Funk volume of cone⁡(G) relative to a pointed cone K as a boundary integral involving the projected areas of the dual cross-sections FK⁢(x). In the statement below, Tx denotes the tangent space of G at x.

Figure 8: Lemma 3.1.
Lemma 3.1.

Let K⊂ℝd be a pointed cone and let G⊂int⁡(K) be a convex body. Then

2⋅volKF⁡(cone⁡(G))=1ωd−1⁢∫∂Gλd−1⁢(FK⁢(x)|Tx)⁢𝑑λd−1⁢(x)

(see Figure 8).

The next step in our derivation utilizes the dual facet characterization (Corollary 2.5) to decompose the projection of the polar body into a sum over its facets.

Lemma 3.2.

Let K⊂ℝd be a convex polytope. For any x∈int⁡(K) and any (d−1)-dimensional linear subspace T,

2⁢λd−1⁢((K−x)∘|T)=∑v∈V⁢(K)λd−1⁢(FKv⁢(x−v)|T)

(see Figures 9(a) and (b)).

The proofs of Lemmas 3.1 and 3.2 appear in the full version of the paper [9].

Figure 9: Lemma 3.2 and its proof.

We are now ready to prove the vertex decomposition theorem from Section 1.

Proof.

(Of Theorem 1.2) For each v∈V⁢(K), applying Lemma 3.1 to the pair (Kv,G−v) yields

2⋅volKvF⁡(Gv)=1ωd−1⁢∫∂(G−v)λd−1⁢(FKv⁢(x′)|Tx′)⁢𝑑λd−1⁢(x′).

Perform the change of variables x=x′+v. Then ∂(G−v) maps to ∂G, and the tangent spaces are identified as Tx′=Tx, yielding

2⋅volKvF⁡(Gv)=1ωd−1⁢∫∂Gλd−1⁢(FKv⁢(x−v)|Tx)⁢𝑑λd−1⁢(x).

Summing over v∈V⁢(K) and using linearity of integration, we have

2⁢∑v∈V⁢(K)volKvF⁡(Gv)=1ωd−1⁢∫∂G[∑v∈V⁢(K)λd−1⁢(FKv⁢(x−v)|Tx)]⁢𝑑λd−1⁢(x).

By Lemma 3.2, the term in brackets is equal to 2⁢λd−1⁢((K−x)∘|Tx). Substituting this and dividing by 2 yields

∑v∈V⁢(K)volKvF⁡(Gv)=1ωd−1⁢∫∂Gλd−1⁢((K−x)∘|Tx)⁢𝑑λd−1⁢(x).

By Eq. (2), the right-hand side is exactly areaKF⁡(G). ◀

4 Cauchy-Type Formulas for General Convex Bodies

We now derive the general Cauchy formula from the polytope case. The key additional ingredient is a representation of the Funk volume of a cone as an average of the areas of its central shadows. Combined with Theorem 1.2, this yields the formula for polytopal K, and the general case then follows by approximation.

Figure 10: Lemma 4.1 and its proof.
Lemma 4.1 (Funk Volume of a Cone).

Let K and G be pointed cones in ℝd with (G∖{O})⊂int⁡(K). Let U=K∘∩Sd−1 (the spherical image of the polar cone), and for u∈U, let S⁢(u)=−u∗∩G (see Figure 10(a)). Then

volKF⁡(G)=1ωd−1⁢∫Uλd−1⁢(S⁢(u))⁢𝑑σ⁢(u). (5)

Proof.

Let Σ=Sd−1∩G and define the double integral

I=1ωd−1⁢∫U∫Σ|⟨s,u⟩|−d⁢𝑑σ⁢(s)⁢𝑑σ⁢(u).

Since the integrand is nonnegative, by Tonelli’s theorem [28, Theorem 8.8(a)], we may integrate in either order. We will show that one order leads to the right-hand side of Eq. (5), and the other leads to the left-hand side.

First fix u∈U and consider the inner integral in s. Since u∈K∘ and (G∖{O})⊂int⁡(K), we have ⟨s,u⟩<0 for all s∈Σ. Applying Lemma 2.6 to the cone G with center u, we obtain

∫Σ|⟨s,u⟩|−d⁢𝑑σ⁢(s)=λd−1⁢(−u∗∩G)=λd−1⁢(S⁢(u))

(see Figure 10(a)). Substituting into I yields the right-hand side of Eq. (5).

Next fix s∈Σ and consider the inner integral in u. Since s∈Σ⊂int⁡(K) and U=K∘∩Sd−1, we have ⟨u,s⟩<0 for all u∈U. Applying Lemma 2.6 to the cone K∘ with center s, we obtain

∫U|⟨u,s⟩|−d⁢𝑑σ⁢(u)=λd−1⁢(−s∗∩K∘)=λd−1⁢(FK⁢(s))

(see Figure 10(b)). Substituting into I, we obtain

I=1ωd−1⁢∫Σλd−1⁢(FK⁢(s))⁢𝑑σ⁢(s).

By the definition of Funk volume (Eq. (4)), this expression is exactly volKF⁡(G), which matches the left-hand side of Eq. (5). ◀

With the cone formula established, we now derive the Cauchy formula for arbitrary convex bodies. Let K⊂ℝd be a convex body and let G⊂int⁡(K) be a convex body. For almost every direction u∈Sd−1, the support set K∩HK⁢(u) is a singleton; denote its unique point by vK⁢(u) [32, Theorem 2.2.11]. On the exceptional null set, choose vK⁢(u) arbitrarily in K∩HK⁢(u). For each u∈Sd−1, define the central shadow by

SK⁢(G,u):=−u∗∩cone⁡(G−vK⁢(u))

(recall Figure 1). We are now ready to prove Theorem 1.1.

Proof of Theorem 1.1.

Assume first that K is a convex polytope. For each vertex v∈V⁢(K), let

Uv:=Kv∘∩Sd−1

denote the spherical image of the normal cone at v. The collection {Uv}v∈V⁢(K) forms a partition of Sd−1 up to a set of σ-measure zero. For almost every u∈Uv, the support point of K in direction u is unique and equals v. Recalling that Gv=cone⁡(G−v), it follows that for almost every u∈Uv,

SKv⁢(Gv,u)=SK⁢(G,u).

Therefore, by Theorem 1.2 and Lemma 4.1, we obtain

areaKF⁡(G) =∑v∈V⁢(K)volKvF⁡(Gv)
=∑v∈V⁢(K)1ωd−1⁢∫Uvλd−1⁢(SKv⁢(Gv,u))⁢𝑑σ⁢(u)
=1ωd−1⁢∑v∈V⁢(K)∫Uvλd−1⁢(SK⁢(G,u))⁢𝑑σ⁢(u)
=1ωd−1⁢∫Sd−1λd−1⁢(SK⁢(G,u))⁢𝑑σ⁢(u).

This establishes the result when K is a polytope. The general case follows by approximating K in the Hausdorff metric by convex polytopes Km, applying the polytopal identity to Km, and passing to the limit using the continuity of polarity and the Dominated Convergence Theorem; details appear in the full version [9]. ◀

From a computational perspective, when K is a polytope, the preceding proof yields a natural Monte-Carlo estimator. The identity

areaKF⁡(G)=∑v∈V⁢(K)1ωd−1⁢∫Uvλd−1⁢(SKv⁢(Gv,u))⁢𝑑σ⁢(u)

decomposes the surface area into local contributions indexed by the vertices of K. The sampling distribution depends only on the spherical normal-cone decomposition {Uv}v∈V⁢(K), while the sampled quantity is the (d−1)-dimensional volume of the corresponding central shadow. Thus one may sample a vertex v with probability proportional to σ⁢(Uv) and then sample a direction u uniformly from Uv, for example by triangulating the normal cone into simplicial cones. This gives an unbiased estimator whose evaluation uses only geometry local to the chosen vertex. In particular, it avoids direct use of the Holmes–Thompson definition through Eq. (2), which would require integrating

λd−1⁢((K−x)∘|Tx)

over all x∈∂G.

Using Lemma 2.6, we can rewrite the shadow integral in Theorem 1.1 in terms of the spherical cross-sections of the subtended cones. For any v∈∂K, let

Σ⁢(G,v):=Sd−1∩cone⁡(G−v)

denote the spherical cross-section of the cone subtended by G at v. The following corollary gives a double-integral representation of the Funk surface area.

Corollary 4.2 (Double-Integral Formula for Funk Area).

Let G and K be convex bodies in ℝd with G⊂int⁡(K). Then

areaKF⁡(G)=1ωd−1⁢∫Sd−1∫Σ⁢(G,vK⁢(u))|⟨s,u⟩|−d⁢𝑑σ⁢(s)⁢𝑑σ⁢(u).

Proof.

By Theorem 1.1,

areaKF⁡(G)=1ωd−1⁢∫Sd−1λd−1⁢(SK⁢(G,u))⁢𝑑σ⁢(u).

For each u∈Sd−1,

SK⁢(G,u)=−u∗∩cone⁡(G−vK⁢(u)).

Since vK⁢(u) is a support point of K in direction u and G⊂int⁡(K), we have ⟨s,u⟩<0 for all s∈Σ⁢(G,vK⁢(u)). Applying Lemma 2.6 with C=cone⁡(G−vK⁢(u)) and center u, we obtain

λd−1⁢(SK⁢(G,u))=∫Σ⁢(G,vK⁢(u))|⟨s,u⟩|−d⁢𝑑σ⁢(s).

Substituting this into the preceding formula completes the proof. ◀

We now recast Corollary 4.2 as a Crofton formula on oriented lines. For each u∈Sd−1, choose vK⁢(u)∈K∩HK⁢(u) as above, and let

𝒫:={(u,s)∈Sd−1×Sd−1⁢S⁢T⁢⟨s,u⟩<0}.

For (u,s)∈𝒫, let ℓK+⁢(u,s) denote the oriented line through vK⁢(u) in direction s. For fixed u∈Sd−1, a direction s∈Sd−1 with ⟨s,u⟩<0 belongs to Σ⁢(G,vK⁢(u)) if and only if the ray from vK⁢(u) in direction s meets G. Thus Corollary 4.2 can be rewritten as follows.

Lemma 4.3 (Funk–Crofton formula for oriented lines).

Let G and K be convex bodies in ℝd with G⊂int⁡(K). Then

areaKF⁡(G)=1ωd−1⁢∫𝒫𝟏{ℓK+⁢(u,s)∩G≠∅}⁢|⟨s,u⟩|−d⁢𝑑σ⁢(s)⁢𝑑σ⁢(u).

Replacing each oriented line by its underlying unoriented line, we obtain the following K-dependent parameter-space Crofton formula.

Theorem 4.4 (Funk–Crofton formula for unoriented lines).

Let G and K be convex bodies in ℝd with G⊂int⁡(K). Then

areaKF⁡(G)=1ωd−1⁢∫𝒫𝟏{LK⁢(u,s)∩G≠∅}⁢|⟨s,u⟩|−d⁢𝑑σ⁢(s)⁢𝑑σ⁢(u),

where LK⁢(u,s) denotes the unoriented line underlying ℓK+⁢(u,s).

Proof.

Since intersection with G is independent of orientation, the indicator in Lemma 4.3 is unchanged when ℓK+⁢(u,s) is replaced by its underlying unoriented line LK⁢(u,s). ◀

Concluding Remarks and Open Problems

We established an explicit Cauchy-type formula for the Holmes–Thompson surface area in the Funk geometry induced by a convex body K⊂ℝd. This formula expresses the surface area of a convex body G as the average, over directions u∈Sd−1, of the (d−1)-dimensional measures of the corresponding central shadows of G (Theorem 1.1). For polytopal K, this identity admits a discrete vertex-based decomposition (Theorem 1.2), and the same framework yields a Crofton-type representation in terms of an explicit measure on the space of unoriented lines intersecting G (Theorem 4.4).

Taken together, these results provide a concrete shadow-averaging principle for surface area in a projective Finsler setting. From a computational perspective, our formulas involve Euclidean (d−1)-dimensional volumes of explicitly defined slices or projections, thereby avoiding direct evaluation of the Holmes–Thompson definitions through polars of pointwise Finsler balls. In the polytopal case, the resulting decomposition is especially simple, replacing more combinatorial Crofton descriptions based on pairs of faces by a sum over vertices and normal cones.

Our work raises several natural open problems. A first direction is to develop provably efficient randomized algorithms for estimating Funk surface area from the Cauchy and Crofton formulas, ideally with explicit variance bounds and high-probability guarantees. For polytopal K, this includes efficient sampling from the spherical normal-cone decomposition and efficient evaluation or approximation of the associated central shadows. It would also be interesting to determine to what extent these formulas can serve as practical primitives for geometric computation in Funk- and Hilbert-type domains, in a manner analogous to the role of Cauchy and Crofton formulas in Euclidean stereology, tomography, and randomized surface area estimation.

A second direction is to investigate whether this shadow-based approach extends beyond surface area to higher-order intrinsic quantities, such as the Holmes–Thompson analogs of quermassintegrals or curvature measures. A third is to better understand the relationship with Hilbert geometry, especially by identifying conditions on K under which the Funk formula yields the exact Hilbert surface area beyond the known cases of d=2 and ellipsoids. More generally, it would be interesting to determine how geometric properties of K govern the approximation gap between Hilbert and Funk surface areas.

References

  • [1] C. Aaron, A. Cholaquidis, and R. Fraiman. Estimation of surface area. Electronic Journal of Statistics, 16(2):3751–3788, 2022. doi:10.1214/22-EJS2031.
  • [2] A. Abdelkader and D. M. Mount. Convex approximation and the Hilbert geometry. In Proc. SIAM Symp. Simplicity in Algorithms (SOSA24), pages 286–298, 2024. doi:10.1137/1.9781611977936.26.
  • [3] P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. Assoc. Comput. Mach., 51:606–635, 2004. doi:10.1145/1008731.1008736.
  • [4] R. Alexander. Planes for which the lines are the shortest paths between points. Ill. J. Math., 22:177–190, 1978. doi:10.1215/ijm/1256048729.
  • [5] R. Alexander, I. D. Berg, and R. L. Foote. Integral-geometric formulas for perimeter in S2, H2, and Hilbert planes. Rocky Mountain J. Mathematics, 35(6):1825–1859, 2005. URL: http://www.jstor.org/stable/44238783.
  • [6] J. C. Álvarez Paiva and E. Fernandes. Crofton formulas in projective Finsler spaces. Electron. Res. Announc. Amer. Math. Soc., 4:91–100, 1998. URL: http://eudml.org/doc/224916.
  • [7] R. Arya, S. Arya, G. D. da Fonseca, and D. M. Mount. Optimal bound on the combinatorial complexity of approximating polytopes. ACM Trans. Algorithms, 18:1–29, 2022. doi:10.1145/3559106.
  • [8] S. Arya, G. D. da Fonseca, and D. M. Mount. Economical convex coverings and applications. SIAM J. Comput., 53(4):1002–1038, 2024. doi:10.1137/23M1568351.
  • [9] S. Arya and D. M. Mount. Cauchy’s surface area formula in the funk geometry, 2026. doi:10.48550/arXiv.2601.16468.
  • [10] A. Baddeley and E. B. V. Jensen. Stereology for Statisticians. CRC Press, 2005. doi:10.1201/9780203496817.
  • [11] A. Barvinok. A Course in Convexity, volume 54 of Graduate Studies in Mathematics. American Mathematical Society, 2002. URL: https://bookstore.ams.org/gsm-54/.
  • [12] J.-D. Boissonnat, F. Nielsen, and R. Nock. Bregman Voronoi diagrams. Discrete Comput. Geom., 44:281–307, 2010. doi:10.1007/s00454-010-9256-1.
  • [13] J. W. Cannon, W. J. Floyd, R. Kenyon, and W. R. Parry. Hyperbolic geometry. In S. Levy, editor, Flavors of Geometry, volume 31 of MSRI Publications, pages 59–115. Cambridge University Press, 1997.
  • [14] K. L. Clarkson. Building triangulations using ε-nets. In Proc. 38th Annu. ACM Sympos. Theory Comput., pages 326–335, 2006. doi:10.1145/1132516.1132564.
  • [15] M. P. do Carmo. Differential Geometry of Curves and Surfaces. Prentice Hall, 1976.
  • [16] D. Faifman. A Funk perspective on billiards, projective geometry and Mahler volume. J. Differential Geom., 127:161–212, 2024. doi:10.4310/jdg/1717356157.
  • [17] D. Faifman, C. Vernicos, and C. Walsh. Volume growth of Funk geometry and the flags of polytopes. Geometry & Topology, 29(7):3773–3811, 2025. doi:10.2140/gt.2025.29.3773.
  • [18] R. J. Gardner. Geometric Tomography. Cambridge University Press, 2nd edition, 2006. doi:10.1017/CBO9781107341029.
  • [19] R. D. Holmes and A. C. Thompson. n-dimensional area and content in Minkowski spaces. Pacific J. Math., 85:77–110, 1979. doi:10.2140/pjm.1979.85.77.
  • [20] M. Ito, Y. Seo, T. Yamazaki, and M. Yanagida. Geometric properties of positive definite matrices cone with respect to the Thompson metric. Linear Algebra Appl., 435:2054–2064, 2011. doi:10.1016/j.laa.2011.03.063.
  • [21] D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá. Hyperbolic geometry of complex networks. Phys. Rev. E, 82, 2010. doi:10.1103/PhysRevE.82.036106.
  • [22] X. Li, W. Wang, R. R. Martin, and A. Bowyer. Using low-discrepancy sequences and the crofton formula to compute surface areas of geometric models. Computer-Aided Design, 35(9):771–782, 2003. doi:10.1016/S0010-4485(02)00100-8.
  • [23] W. Lin, V. Duruisseaux, M. Leok, F. Nielsen, M. E. Khan, and M. Schmidt. Simplifying momentum-based positive-definite submanifold optimization with applications to deep learning. In Proc. 40th Internat. Conf. Mach. Learn., 2023. arXiv:2302.09738.
  • [24] Y.-S. Liu, J. Yi, H. Zhang, G.-Q. Zheng, and J.-C. Paul. Surface area estimation of digitized 3d objects using quasi-monte carlo methods. Pattern Recognition, 43:3900–3909, 2010. doi:10.1016/j.patcog.2010.06.002.
  • [25] F. Nielsen and K. Sun. Clustering in Hilbert’s projective geometry: The case studies of the probability simplex and the elliptope of correlation matrices. In Geometric Structures of Information, Signals and communication technology, pages 297–331. Springer International Publishing, 2019. doi:10.1007/978-3-030-02520-5_11.
  • [26] A. Papadopoulos and M. Troyanov. Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry. Expo. Math., 27:109–124, 2009. doi:10.1016/j.exmath.2008.10.001.
  • [27] A. Papadopoulos and M. Troyanov. Handbook of Hilbert Geometry. EMS Press, 2014. doi:10.4171/147.
  • [28] W. Rudin. Real and Complex Analysis. McGraw Hill, 3rd edition, 1987.
  • [29] R. Schneider. Crofton formulas in hypermetric projective Finsler spaces. Archiv der Mathematik, 77:85–97, 2001. doi:10.1007/PL00000469.
  • [30] R. Schneider. Crofton measures in polytopal Hilbert geometries. Beitr. Algebra Geom., 47:479–488, 2006. URL: https://www.emis.de/journals/BAG/vol.47/no.2/12.html.
  • [31] R. Schneider. Crofton measures in projective Finsler spaces. In E. L. Grinberg, S. Li, G. Zhang, and J. Zhou, editors, Integral Geometry and Convexity, pages 67–98. World Scientific, 2006. doi:10.1142/9789812774644_0006.
  • [32] R. Schneider. Convex Bodies: The Brunn-Minkowski Theory, volume 151 of Encyclopedia of Mathematics and its Applications. Cambridge Univ. Press, 2nd edition, 2014. doi:10.1017/CBO9781139003858.
  • [33] A. C. Thompson. Minkowski Geometry, volume 63 of Encyclopedia of mathematics and its applications. Cambridge University Press, 1996. doi:10.1017/CBO9781107325845.
  • [34] M. Troyanov. Funk and Hilbert geometries from the Finslerian viewpoint. In Handbook of Hilbert geometry, pages 69–110. European Mathematical Society Publishing House, 2014. doi:10.4171/147-1/3.
  • [35] Günter M. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1995. doi:10.1007/978-1-4613-8431-1.