Digital Euler Characteristic Transform

Henry Kirveslahti; Xiaohan Wang

REVIEW 4 major objections 5 minor 15 references

Digital Euler Characteristic Transform

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that the Euler Characteristic Transform, a topological shape summary usually approximated on discrete grids, can be computed exactly for piecewise-linear meshes: the transform becomes a finite set of spherical polygons…

desk verdict Useful algorithmic contribution, but the 3D exactness claim is not proven as written; the triangulation rule in Section 4 can omit needed edges. read the letter →

arxiv 2411.08522 v1 pith:VDFSY3BK submitted 2024-11-13 math.AT

Henry Kirveslahti , Xiaohan Wang This is my paper · ORCID

classification math.AT MSC 62R4068U0555N31

keywords EulercharacteristictransformtopologicaldataanalysisstatisticalshapeRadonpiecewiselinearmeshclosed-formdistancealignmentEctoplasm

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that the Euler Characteristic Transform, a way to summarize a shape's topology without landmarks, can be computed exactly for piecewise-linear meshes rather than approximated on a grid of directions and heights. The key step is representing the transform as finitely many spherical polygons, each carrying a constant per-vertex gain, so that the ECT distance between two shapes becomes a sum of closed-form spherical integrals. The authors implement this in the Ectoplasm package and show it runs fast enough for a real dataset of primate molars. Because the exact transform is equivariant under rotations and almost everywhere differentiable, the paper also demonstrates shape alignment by gradient descent and adaptive grid search, methods that are impractical with the discretized transform.

What carries the argument

The proto-transform format is the central device: a mesh's ECT is stored as finitely many spherical polygons P_k on S², each labeled by an ordered list b_k of vertices and gains a_k describing the jumps of the Euler curve at those vertices. Inside each polygon the vertex order is constant, so the ECT is a simple function of the vertex height functions, and the inner product of two transforms is a sum over polygon intersections of products of gains times closed-form integrals of height functions. The 3D integrals are evaluated using a parametrization of great circles as tan τ = a cos(φ−φ0) and Stokes' theorem, reducing each term to elementary trigonometric integrals. Localization to vertex stars keeps the complexity at O(n k³) rather than O(n³), with k near 6 for typical meshes.

What would settle it

Take a mesh with a degenerate direction, for example a cube or regular octahedron oriented so that four vertices share a height for a direction such as v = (1,1,1)/√3, run the published triangulation rule, and compare the closed-form ECT distance to an adaptive numerical integration of Equation (3) over the sphere with, say, a million directions; any discrepancy beyond floating-point error, or any failure to terminate due to unhandled coincident points, would falsify the exactness claim. Also check whether the gain a_k is constant on each produced spherical polygon by direct evaluation at several interior directions.

Watch

Extended reading notes

Core claim

The paper's central claim is that the ECT distance between two piecewise-linear meshes can be evaluated exactly, up to floating-point precision, with no discretization of directions or heights. Concretely, each mesh is converted into the proto-transform format—a finite collection of spherical polygons with constant per-vertex gains—so that the squared distance ||X−Y||² = ⟨X,X⟩ − 2⟨X,Y⟩ + ⟨Y,Y⟩ becomes a finite sum of products of gains times spherical integrals of linear height functions. Since all pieces of the integrand are explicit, the integral over S²×[−1,1] is computed in closed form. The paper implements this in the Ectoplasm package, shows it scales to a real primate-molar dataset, and uses it to compare the digital distances with discretized ECT, landmark, and continuous-Procrustes distances. It further claims that the digital transform enables gradient-descent and adaptive-grid-search alignment, because the alignment penalty is almost everywhere differentiable and the transform is genuinely O(3)-equivariant.

Load-bearing premise

The 3D algorithm's exactness rests on the claim that connecting equi-height points that share two vertex labels produces spherical polygons on which each vertex's gain is constant; the paper states this rule but does not prove it, and it gives no tie-breaking rule for degenerate directions where four or more vertices have equal height.

Editorial extensions

If this is right

ECT-based distances are computed in closed form, eliminating the need to choose direction and height grids and providing a reproducible ground truth for assessing any discretization.
The exact transform makes the O(3)-equivariance of the ECT practically usable: the alignment penalty map is almost everywhere differentiable, so shape alignment can be solved by gradient ascent and adaptive grid search rather than permutation approximation on a fixed rotation grid.
The digital representation turns the ECT from a vector of samples into a function of directions and heights, which means statistical methods for the transform must be reworked in a functional-data-analysis setting.
The exact transform makes Schapira-type inversion, recovering a shape from its transform, a realistic prospect rather than a discretization-limited one.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The same polygon-decomposition strategy could in principle be applied to other topological transforms with piecewise-constant structure, such as the persistent homology transform, though the paper notes the computational cost would be far higher.
If the missing tie-breaking rule fails on degenerate meshes, the exactness claim would hold only for generic meshes; perturbing vertices by an infinitesimal amount and taking limits might restore exactness in distribution.
The Mantel-correlation table against the digital distance provides a ready-made protocol: future ECT discretizations can be benchmarked against the exact distance, potentially replacing the current practice of increasing grid size until distances stabilize.
The gradient-descent alignment, demonstrated on a high-curvature mesh, hints that the same machinery could be used to define paths through shape space for more general transformation groups, subject to avoiding self-intersections.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Kirveslahti and Wang have put together a genuinely useful computational tool: a way to evaluate the ECT distance integral for piecewise-linear meshes in closed form, per-star, with code on GitHub. The mathematical representation is explicitly credited to Curry, Mukherjee, and Turner, and the novelty is algorithmic — the per-star spherical polygon decomposition and the closed-form surface integrals. The 2D brute-force example is worked through carefully, the integration formulas in the appendix are plausible, and the alignment applications (adaptive grid search and gradient descent) are reasonable proof-of-concept demonstrations that exploit the exact equivariance. This is a solid contribution to TDA practice.

The soft spot is load-bearing. The exactness of the 3D algorithm rests on Step 3 of Section 4, the rule for connecting vertices of the spherical arrangement. The rule connects two vertices only when their inner product is non-negative, i.e., when the shorter great-circle arc is at most 90 degrees. But adjacent vertices on a great circle can be more than 90 degrees apart. Concretely, take the tetrahedron with a vertex at the origin and neighbors (1,0,0), (0,1,0), (0, cos 120°, sin 120°). On the great circle x=0, the intersections with the other two circles occur at 30°, 90°, 210°, 270°; the vertices at 90° and 210° are adjacent on that circle, yet their dot product is -1/2, so Step 3 omits the edge. Then the 'triangles' do not refine the stratification of directions, gains need not be constant on them, and the computed integral need not equal the continuous ECT distance. As written, the central claim of 'exactly, up to computer precision' is unsupported. The fix may be simple — connect all adjacent vertices along each great circle, or give a correct perturbation/tie-breaking rule — but it needs to be stated and proved.

Also worth noting: Table 4 validates the digital algorithm by using it as ground truth against discretizations; that is circular unless the exactness is independently verified for 3D. The data and preprocessing for the case study are not released, which limits reproducibility of the empirical claims. The gradient descent experiment has some tuning parameters (learning rate schedule, initial grid) that are ad hoc, but that is standard for a proof-of-concept.

Overall, the algorithmic idea is valuable and likely salvageable, but the paper in this form does not establish its main exactness claim. It deserves a serious referee — send it out — but it should not be accepted without a corrected triangulation rule and independent verification.

Referee Report

4 major / 5 minor

Summary. The paper proposes an algorithm, implemented in the Ectoplasm package, for computing the Euler Characteristic Transform (ECT) distance between piecewise-linear meshes in closed form, without discretizing directions or heights. A brute-force 2D version is worked out in detail, and a 3D version is described that computes per-vertex gains from the arrangement of equal-height great circles, then integrates the squared ECT difference using spherical polygon formulas. The authors also present a comparison of digital and discretized ECT distances on a primate molar dataset and two alignment algorithms (adaptive grid search and gradient descent) enabled by the digital transform. The central claim is exactness of the computed distance up to computer precision.

Significance. If the exactness claim is correct, this is a valuable contribution to applied topology and shape analysis: it removes discretization parameters, provides O(d)-equivariant transforms, enables gradient-based alignment, and gives a ground truth for assessing discretization error. The paper ships a public implementation and includes a real-data case study. The significance is conditional, however, on a rigorous proof of the 3D triangulation step, which the manuscript does not currently provide.

major comments (4)

[Section 4, Step 3] The connection rule does not produce a triangulation of the great-circle arrangement, so the cells on which gains are evaluated are not cells of constant ECT structure. For a tetrahedron with central vertex at the origin and neighbors (1,0,0), (0,1,0), and (0,-1/2,√3/2), on the great circle v_x=0 the intersection points with the other two equal-height circles occur at angular positions 30°, 90°, 210°, and 270°. The consecutive pair 90° and 210° are 120° apart, have inner product -1/2, and are therefore not connected by Step 3. This omits an edge of the arrangement, so triangles spanning that arc do not refine the stratification, and the gain is not constant on them. The claim that Equation (3) is evaluated exactly is thus unsupported as written.
[Section 4, Steps 2-3] The algorithm does not specify how to handle degenerate configurations, such as four or more vertices whose equal-height planes are concurrent along a direction, or triple intersection points that coincide. No perturbation or tie-breaking rule is provided, so the triangulation step is not well-defined for such inputs. A rigorous treatment of these strata is needed to support the 'exact, up to computer precision' claim.
[Table 4] The validation uses the digital algorithm as the ground truth to assess discretization errors. This is circular unless the digital algorithm's exactness is independently established; given the issue in Section 4 Step 3, the 'true values' in Table 4 are not demonstrated to be the continuous ECT distance, so the reported correlations may not measure actual discretization error.
[Appendix A, Proposition A.2] The displayed formula for I_k^1 has identical numerator and denominator, making the integral identically equal to the interval length. This is presumably a typo, but as printed the spherical integration formula cannot be correct, and since this formula underlies the closed-form 3D distance computation, the algorithm's output is not reproducible from the manuscript.

minor comments (5)

[Title page] The title reads 'DIGIT AL EULER CHARACTERISTIC TRANSFORM'; it should read 'DIGITAL EULER CHARACTERISTIC TRANSFORM'.
[Section 5.2] The number of directions is given as 326, but the resulting matrix size is reported as 362 × 100; the discrepancy (326 vs 362) should be resolved.
[Section 3, Definition 3.2] The expression for ϵ should use absolute values, e.g., ε = min_{j,k} |⟨x_j - x_k, v⟩|/2, to guarantee positivity.
[Section 6.2] The learning rate description 'λ = 1 for the first 30 iterations and 0.1 after the 20 following iterations and 0.01 thereafter' is ambiguous; please clarify the iteration ranges.
[Appendix A] The condition that the spherical polygon does not intersect 'any meridian' is not well-defined, since there are infinitely many meridians; presumably the authors mean the prime meridian, but the text should be explicit. The claim that a rotation can always make the restrictions hold should also be justified in the context of a global computation.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the digital ECT derivation is built from external prior results and independent spherical integration.

full rationale

The derivation chain is not circular. The claimed exact ECT distance is obtained by representing each mesh in the proto-transform format, whose gains and vertex order come from vertex-height inequalities, applying the local-gain fact of Proposition 4.1, and integrating products of these piecewise-constant representations using the closed-form spherical formulas of Appendix A. The key structural ingredients (Propositions 3.1, 3.3, and Lemma 5.19) are cited to Curry, Mukherjee, and Turner [5] and to Schapira [11], not to the authors' own prior work. The authors explicitly disclaim novelty for the analytic expression, writing that it is 'equivalent to the formula in Lemma 5.19 of [5], expressed in explicit coordinates.' The only self-references, [8] and [14], are used as examples of lifted ECT and an earlier discretized alignment pipeline; they are not load-bearing for the exactness claim. The use of the digital algorithm as 'ground truth' in Table 4 is a validation comparison, not a fitted parameter renamed as a prediction, so it does not make the derivation circular; it does mean the exactness is asserted rather than independently benchmarked. The possible failure of Section 4 Step 3's connection rule to triangulate the great-circle arrangement is a correctness gap in the algorithm's proof, not a circular reduction of the conclusion to the input. No pattern 1-6 is present.

Assumptions & free parameters 2 free parameters · 6 assumptions · 0 invented entities

The central ECT algorithm has no fitted parameters; the only hand-chosen numbers are demonstration hyperparameters in Section 6. The mathematical results it relies on are external prior work, chiefly Curry et al. [5], plus standard geometry and Stokes' theorem. The main domain-specific assumptions are the vertex-only transitions of the Euler curve and the per-star locality of gains, both reasonable for piecewise-linear meshes but not re-derived in this paper.

free parameters (2)

Learning rate lambda schedule in gradient ascent = 1 for iterations 1-30, 0.1 for iterations 31-50, 0.01 thereafter
Hand-chosen for the proof-of-concept alignment in Section 6.2; not part of the ECT distance algorithm and does not affect the claimed exactness.
Initial adaptive grid dimensions = 8 x 8 x 5 = 320 points
Hand-chosen initial grid for the adaptive grid search in Section 6.1; a demonstration choice, not a fitted parameter.

assumptions (6)

domain assumption For a piecewise linear mesh, the Euler curve in a generic direction changes only at heights equal to vertex projections (Proposition 3.1).
Stated with proof cited to Curry et al. [5], Proposition 5.18; it is the foundation for the proto-transform representation.
domain assumption Two directions with the same ordering of vertex heights have the same ECT (Proposition 3.3).
Stated with proof cited to [5], Lemma 5.19; used to partition the sphere into finitely many regions.
domain assumption The gain in Euler characteristic at a vertex is determined entirely by the star of that vertex (Proposition 4.1).
Used to localize the computation to vertex stars; the proof is a one-sentence inclusion-exclusion argument that is not fully detailed.
domain assumption A spherical polygon can be rotated so that it avoids the excluded set I, the equator and all meridians, and this rotation preserves the integral of the height function (Appendix A).
The paper asserts this is 'always possible and efficient' without proof; it depends on rotational invariance of the inner product integral.
standard math Stokes' theorem applies to the spherical polygon boundary to convert the surface integral into edge integrals (Appendix A).
Standard theorem; the calculation in Proposition A.2 relies on it.
domain assumption Meshes are finite geometric simplicial complexes contained in the unit ball.
Assumed throughout the paper to justify unit-ball integration and the finite representation of the ECT.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Digital Euler Characteristic Transform." pith.science (2026). https://pith.science/paper/VDFSY3BK

@misc{pith2026241108522,
  author       = {Pith},
  title        = {Pith review of: Digital Euler Characteristic Transform},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VDFSY3BK}},
  note         = {Machine review of arXiv:2411.08522}
}

read the original abstract

The Euler Characteristic Transform (ECT) of Turner et al. provides a way to statistically analyze non-diffeomorphic shapes without relying on landmarks. In applications, this transform is typically approximated by a discrete set of directions and heights, which results in potential loss of information as well as problems in inverting the transform. In this work we present a fully digital algorithm for computing the ECT exactly, up to computer precision; we introduce the Ectoplasm package that implements this algorithm, and we demonstrate this is fast and convenient enough to compute distances in real life data sets. We also discuss the implications of this algorithm to related problems in shape analysis, such as shape inversion and sub-shape selection. We also show a proof-of-concept application for solving the shape alignment problem with gradient descent and adaptive grid search, which are two powerful methods neither of which is possible using the discretized transform.

Figures

Figures reproduced from arXiv: 2411.08522 by the authors.

**Figure 1.** Example 3.5, the height functions of the 4 vertices. The vertical lines represent equi-height angles, or endpoints of each Pk. Vertices 1,2,3 and 4 are represented in black, red, green and blue, respectively. Example 3.5. In this example we compute the ECT inner product of a 2D-triangle by hand, following the brute force algorithm. Let Σ be an abstract simplicial complex {(123, 234)}, and consider its geometric real… view at source ↗

**Figure 2.** These are 2-D summaries of the distance matrix, projecting points to [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗

**Figure 2.** Multidimensional Scaling plots of the different distances. The clustering is quite similar across the methods, with Omnivores and Frugivores forming their own clusters. at capturing the distances as a whole. Interestingly, the digital method has smaller correlation with the two non-ECT methods than the discrete one. In [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗

Figures from the paper (1 more)

**Figure 3.** Figure 3: t-sne plots based on the distances from the two ECT methods [PITH_FULL_IMAGE:figures/full_fig_p015_3.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

[1]

A sheaf-theoretic construction of shape space

Shreya Arya, Justin Curry, and Sayan Mukherjee. A sheaf-theoretic construction of shape space. Foundations of Computational Mathematics , pages 1–51, 2024

work page 2024
[2]

Morse theory and finiteness properties of groups

Mladen Bestvina and Noel Brady. Morse theory and finiteness properties of groups. Inven- tiones mathematicae, 129:445–470, 1997

work page 1997
[3]

Clair, Jesus Puente, Biren A Patel, Thomas Funkhouser, Jukka Jernvall, and Ingrid Daubechies

Doug M Boyer, Yaron Lipman, Elizabeth St. Clair, Jesus Puente, Biren A Patel, Thomas Funkhouser, Jukka Jernvall, and Ingrid Daubechies. Algorithms to automatically quantify the geometric similarity of anatomical surfaces. Proceedings of the National Academy of Sciences, 108(45):18221–18226, 2011

work page 2011
[4]

A new fully automated approach for aligning and com- paring shapes

Doug M Boyer, Jesus Puente, Justin T Gladman, Chris Glynn, Sayan Mukherjee, Gabriel S Yapuncich, and Ingrid Daubechies. A new fully automated approach for aligning and com- paring shapes. The Anatomical Record, 298(1):249–276, 2015. DIGITAL TOOLS FOR NON-DIFFEOMORPHIC SHAPES 21

work page 2015
[5]

How many directions determine a shape and other sufficiency results for two topological transforms, 05 2018

Justin Curry, Sayan Mukherjee, and Katharine Turner. How many directions determine a shape and other sufficiency results for two topological transforms, 05 2018

work page 2018
[6]

Clairaut’s re- lation and the equation of great circle in spherical coordinates

Robert Israel (https://mathoverflow.net/users/13650/robert israel). Clairaut’s re- lation and the equation of great circle in spherical coordinates. MathOverflow. URL:https://mathoverflow.net/q/247336 (version: 2016-08-12)

work page 2016
[7]

Kells, Willis F

Lyman M. Kells, Willis F. Kern, and James R. Bland. Plane And Spherical Trigonometry . McGraw Hill Book Company, Inc., 1940. Retrieved July 13, 2018

work page 1940
[8]

Representing fields without correspondences: the lifted euler characteristic transform

Henry Kirveslahti and Sayan Mukherjee. Representing fields without correspondences: the lifted euler characteristic transform. Journal of Applied and Computational Topology, 8(1):1– 34, 2024

work page 2024

Show all 15 references

[9]

A framework for differential calculus on persistence barcodes

Jacob Leygonie, Steve Oudot, and Ulrike Tillmann. A framework for differential calculus on persistence barcodes. Foundations of Computational Mathematics , pages 1–63, 2022

2022
[10]

Distances and algorithms to compare sets of shapes for automated biological morphometrics, 2013

Jesus Puente. Distances and algorithms to compare sets of shapes for automated biological morphometrics, 2013

2013
[11]

Tomography of constructible functions

Pierre Schapira. Tomography of constructible functions. In G´ erard Cohen, Marc Giusti, and Teo Mora, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pages 427–435, Berlin, Heidelberg, 1995. Springer Berlin Heidelberg

1995
[12]

Katharine Turner, Sayan Mukherjee, and Doug M. Boyer. Persistent homology transform for modeling shapes and surfaces. Information and Inference: A Journal of the IMA , 3(4):310– 344, 2014

2014
[13]

Tame Topology and O-minimal Structures

Lou van den Dries. Tame Topology and O-minimal Structures. London Mathematical Society Lecture Note Series. Cambridge University Press, 1998

1998
[14]

A statistical pipeline for identifying physical features that differentiate classes of 3d shapes

Bruce Wang, Timothy Sudijono, Henry Kirveslahti, Tingran Gao, Douglas M Boyer, Sayan Mukherjee, and Lorin Crawford. A statistical pipeline for identifying physical features that differentiate classes of 3d shapes. The Annals of Applied Statistics , 15(2):638–661, 2021. Appendi...

2021
[15]

SPi does not intersect with I, equator and any meridian. we denote ϕn+1 = ϕ1 and then have I(pi) = Z SPi opi · v dϕdτ = nX k=1 1 4 sin τi · Ik1 − 1 4 cos τi · Ik2 − 1 2 cos τi · Ik3, where we set the origin to be o, v is the direction vector and Ik1 = Z ϕk+1 ϕk 1 − a2 cos2(ϕ −...

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.

[1] [1]

A sheaf-theoretic construction of shape space

Shreya Arya, Justin Curry, and Sayan Mukherjee. A sheaf-theoretic construction of shape space. Foundations of Computational Mathematics , pages 1–51, 2024

work page 2024

[2] [2]

Morse theory and finiteness properties of groups

Mladen Bestvina and Noel Brady. Morse theory and finiteness properties of groups. Inven- tiones mathematicae, 129:445–470, 1997

work page 1997

[3] [3]

Clair, Jesus Puente, Biren A Patel, Thomas Funkhouser, Jukka Jernvall, and Ingrid Daubechies

Doug M Boyer, Yaron Lipman, Elizabeth St. Clair, Jesus Puente, Biren A Patel, Thomas Funkhouser, Jukka Jernvall, and Ingrid Daubechies. Algorithms to automatically quantify the geometric similarity of anatomical surfaces. Proceedings of the National Academy of Sciences, 108(45):18221–18226, 2011

work page 2011

[4] [4]

A new fully automated approach for aligning and com- paring shapes

Doug M Boyer, Jesus Puente, Justin T Gladman, Chris Glynn, Sayan Mukherjee, Gabriel S Yapuncich, and Ingrid Daubechies. A new fully automated approach for aligning and com- paring shapes. The Anatomical Record, 298(1):249–276, 2015. DIGITAL TOOLS FOR NON-DIFFEOMORPHIC SHAPES 21

work page 2015

[5] [5]

How many directions determine a shape and other sufficiency results for two topological transforms, 05 2018

Justin Curry, Sayan Mukherjee, and Katharine Turner. How many directions determine a shape and other sufficiency results for two topological transforms, 05 2018

work page 2018

[6] [6]

Clairaut’s re- lation and the equation of great circle in spherical coordinates

Robert Israel (https://mathoverflow.net/users/13650/robert israel). Clairaut’s re- lation and the equation of great circle in spherical coordinates. MathOverflow. URL:https://mathoverflow.net/q/247336 (version: 2016-08-12)

work page 2016

[7] [7]

Kells, Willis F

Lyman M. Kells, Willis F. Kern, and James R. Bland. Plane And Spherical Trigonometry . McGraw Hill Book Company, Inc., 1940. Retrieved July 13, 2018

work page 1940

[8] [8]

Representing fields without correspondences: the lifted euler characteristic transform

Henry Kirveslahti and Sayan Mukherjee. Representing fields without correspondences: the lifted euler characteristic transform. Journal of Applied and Computational Topology, 8(1):1– 34, 2024

work page 2024