Solving Wall Distance in O(N log N): Eikonal Equation and Fast Marching
·7 min read
Ten million cells and half a million walls mean five trillion distance checks. Fast Marching solves that wall distance as an Eikonal problem in O(N log N).
Related tags