GridHeuristic
geometry/grid.types.ts:41A pathfinding heuristic — an estimate of the remaining cost from a to b.
To keep A*'s result optimal the estimate must be admissible (never greater
than the true cost) and consistent. The built-in
manhattan/octile helpers satisfy both for unit step costs.
(a: PointPrimitive, b: PointPrimitive) => number