Digital Geometry Processing with Discrete Exterior Calculus
The canonical computational path from cochains and incidence matrices through metric Hodge stars and geometry-processing algorithms.
PAPER ↔ OPERATOR ↔ EXPERIMENT
This is a selective reading path, not an exhaustive bibliography. Each work earns its place by defining an operator used in the lab, comparing a representation choice, or showing where the student experiment can grow.
Read these when an incidence matrix, Hodge star, adjoint, boundary condition, or harmonic component feels like a convention rather than a mathematical choice.
The canonical computational path from cochains and incidence matrices through metric Hodge stars and geometry-processing algorithms.
A representation-aware account of face-, edge-, and vertex-based fields, with their differential operators and Hodge decompositions.
These works separate where a field is stored from how vectors in different tangent planes are compared.
Builds smooth discrete connections with controlled singularities—the intrinsic reference behind connection-based field comparison.
Turns smooth direction-field design and singularity placement into a sparse global eigenproblem.
A practical taxonomy and C++ implementation of tangent bundles, symmetries, representations, matching, and field processing.
Closest exact fields, curl penalties, hard constraints, unit-length fields, and parameterization-aligned fields solve related but different problems.
Optimizes tangent fields that both respect design constraints and correspond exactly to local parameterization gradients.
Develops a principled discrete connection for analysis and design, clarifying what it means to differentiate vertex-based tangent vectors.
The lab’s complex phase is a compact teaching model of this lineage. The important leap is from a local direction to a globally continuous periodic function.
Introduces globally continuous, equally spaced surface stripes as the smallest eigenvector of a sparse connection energy.
Separates designing an approximately geodesic unit field from integrating it into a periodic foliation, including relaxed global integrability.
Extends stripe patterns into an end-to-end differentiable design space and addresses non-uniqueness in the original formulation.
The browser exposes the local-element idea; these systems show two routes into larger compiled research code.
Differentiates small mesh elements through second order and assembles their sparse global gradient and Hessian.
Differentiates optimized LLVM IR across several source languages—a complementary path when research code should remain ordinary compiled code.
One branch supplies the physical destination; the other asks how a computational argument can remain inspectable and editable.
A canonical graphics treatment of shallow water directly on curved surfaces without requiring a global parameterization.
The design north star: claims backed by computational models whose assumptions and calculations remain visible and editable.
Direct precedents for teaching DEC and direction-field design through focused interactive browser assignments.
This page is an orientation map. Follow the project or DOI link for the authors’ preferred BibTeX and version of record, and distinguish an inspiration from an implemented method.