Reasoning
Read the definitions, follow the arguments and examine the conditions of each result.
Background: Polygon angles, Vertices, edges and faces. Start with the model for a brief introduction, follow the guided exploration for a closer look, or work through the arguments and experiment for a detailed study.
What you can learn
- Distinguish a mathematical mesh from its rendered surface.
- Explain elementary refinement invariance.
- Derive the discrete total-curvature identity and its boundary term.
Reading step 1 of 5: Count a cell decomposition
Step 1 · Theorem · Selected
Count a cell decomposition
A mesh describes both a shape and a pattern of connections. Its vertices have persistent identifiers, its edges join pairs of those identifiers, and its faces have ordered boundaries. The Euler characteristic uses these mathematical cells. Duplicate positions created for rendering a sharp edge or a texture seam do not create new cells.
Independent sphere argument. Remove a point inside one face and project the remaining sphere onto the plane. Keep the removed-point face as the unbounded face. Choose a spanning tree of the connected embedded graph; it has V − 1 edges and one complementary face. Delete edges outside that tree one at a time. Each deleted edge lies on a cycle, merges two faces, and reduces E and F by one. The tree therefore has V − (V − 1) + 1 = 2, and reversing the deletions gives V − E + F = 2 for the original spherical decomposition. This planar argument establishes the sphere case without using the curvature identity.
For a compact connected orientable surface, the classification formula is χ = 2 − 2g − b, where g is the genus and b counts boundary components. The classification theorem requires more than a picture. This exhibit restricts its claims to the validated surface models and their stated decompositions.
Conditions and assumptions
- A valid finite cell decomposition; the genus formula additionally requires connectedness and orientability.
Sources: [M1] Discrete Differential Geometry: An Applied Introduction
Step 2 · Derivation
Refinement preserves the count
Insert one vertex into an edge. The original edge becomes two edges, so the changes in V and E are both one; F is unchanged. Their contributions to V − E + F cancel. Now draw a diagonal across a disk-shaped polygonal face. One additional edge divides one face into two, so the changes in E and F cancel instead.
A cube makes the second operation explicit. Triangulating its six faces changes the counts from (8,12,6) to (8,18,12), while χ remains 2. These arguments establish invariance for the described elementary refinements. They are not, by themselves, a proof of the full classification of surfaces.
Theorem. The Euler characteristic is independent of the finite cell decomposition of a compact surface.
Conditions and assumptions
- A valid finite cell decomposition of the same surface.
Sources: [M1] Discrete Differential Geometry: An Applied Introduction
Step 3 · Derivation
Total curvature on a closed triangular mesh
At a vertex, add the angles of all incident triangles. Subtract that sum from a full turn of 2π to obtain the angle defect. This is integrated curvature assigned to a vertex, not a smooth Gaussian curvature value per unit area.
Summing over vertices counts each triangle angle exactly once. Every flat triangle contributes π, so the total defect is 2πV − πF. On a closed triangular manifold, counting face-edge incidences gives 3F = 2E because every edge has two incident faces. Substitution gives 2π(V − E + F). Stretching can redistribute individual defects while this total remains fixed under the stated conditions.
Theorem. The sum of vertex angle defects on a closed triangular surface equals 2π times its Euler characteristic.
Conditions and assumptions
- Closed manifold mesh with nondegenerate flat triangular faces.
- Finite, nondegenerate Euclidean triangular faces.
- Each edge belongs to exactly two faces; vertex neighborhoods are disks.
Sources: [M1] Discrete Differential Geometry: An Applied Introduction
Step 4 · Derivation
Include boundary turning
The neighborhood of a boundary vertex is a half-disk, so its reference angle is π rather than 2π. Add interior defects to the boundary turning terms π minus the incident angle sum. The total is π(2Vᵢ + Vᵦ − F), where the subscripts distinguish interior and boundary vertices. Counting incidences gives 3F = 2Eᵢ + Eᵦ, and each boundary cycle has Vᵦ = Eᵦ. Substitution gives 2π(V − E + F).
A disk and an annulus illustrate why boundary data matter. Their Euler characteristics are 1 and 0, with one and two boundary components respectively. Applying only the closed-surface defect formula to either model would use the wrong reference angles. The measurements therefore separate the interior and boundary contributions before combining them.
Derivation. For a surface with boundary, interior defects and boundary turning angles together give the total-curvature identity.
Conditions and assumptions
- A manifold boundary and a valid triangular decomposition.
- A valid triangular surface with manifold boundary.
- Angles are measured in the individual flat faces.
Sources: [M1] Discrete Differential Geometry: An Applied Introduction
Step 5 · Numerical experiment
Interpret the numerical residual
The experiment evaluates face angles from the current vertex coordinates, adds the resulting defects, and compares their total with the independently counted value 2πχ. The recorded residual is the actual floating-point difference; it is not replaced by a theoretical zero.
Changing resolution changes the decomposition. Changing a positive axis scale changes geometry without identifying or cutting vertices. Neither operation turns a sphere into a torus. A model switch changes topology explicitly. Agreement within a scale-aware tolerance supports this implementation and these examples; the derivation supplies the mathematical justification.
Sources: [M1] Discrete Differential Geometry: An Applied Introduction
References and review status
Project attribution: BIPH Math Society. The exposition was prepared with tool assistance.
Review status: Not reviewed. Independent review by a teacher or society member has not yet been recorded. Numerical checks do not replace mathematical review.
[M1] Discrete Differential Geometry: An Applied Introduction
Keenan Crane
Version dated 29 January 2025. Chapter 2 and Sections 5.5–5.6 provide the background for triangular surfaces, angle defect and discrete Gauss–Bonnet. The exhibit’s explanations and implementation are original project work. Source checked 16 September 2026.