For each point X[i]
in the pattern X
, this algorithm computes an
approximation to the value of the heat kernel with source point
X[i]
evaluated at the same location.
The heat kernel \(\kappa(u,v)\) for a source location \(u\)
evaluated at location \(v\)
can be expressed as an infinite sum of contributions
from all possible paths from \(u\) to \(v\).
This algorithm applies to the special case \(u=v\) where the source
point and the query point are the same.
The algorithm computes an approximation to \(\kappa(u,u)\)
by taking only the contributions from paths
which (a) remain in the line segment containing the point \(u\) and
(b) visit a vertex at most nmax
times.