Differentiable Randers‐Finsler Eikonal Solvers

Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics. We present a differentiable Eikonal solver for Randers–Finsler metrics on Cartesian grids that combines the efficiency of a GPU‐friendly column/row fast sweeping with exact gradients obtained by implicit differentiation. Our forward pass uses local one‐ and two‐point upwind updates selected by a causality‐valid stencil; the backward pass exploits the induced arrival‐time ordering to solve the adjoint system via a single reverse‐time back‐substitution, avoiding unrolling (i.e., recording and differentiating through every solver iteration) and substantially reducing memory and runtime. We derive closed‐form derivatives of the discrete updates with respect to arrival times and Randers parameters, and we enforce metric feasibility with differentiable projections that guarantee positive definiteness and valid drift magnitude. Although stencil selection is piecewise‐smooth, we show gradients are stable under small perturbations and match finite differences away from stencil boundaries. We demonstrate accurate forward solutions and enable inverse problems such as recovering spatially varying anisotropic metrics and drift fields from sparse arrival‐time supervision. Finally, we apply the method to learning data‐driven spread models on real wildfire perimeters, illustrating scalability and the practical utility of differentiable Randers distance fields.