3-dimensional jump point search algorithm
An answer to this question on Stack Overflow.
Question
Is there an implementation of three-dimensional (or even D-dimensional) jump point search algorithm?
Currently I can find only a 2-dimensional one, but I think it possible to formulate the algorithm for higher dimensions.
Answer
The jump point algorithm is due to Harabor and Grastien's 2011 paper "Online Graph Pruning for Pathfinding on Grid Maps". In this original paper, their abstract says:
In this paper we present a novel search strategy, specific to grids, which is fast, optimal and requires no memory overhead.
Their 2012 and 2014 follow-up papers seem similarly restricted.
Using Google Scholar to search citations of the 2011 paper containing the word "three" (as in three-dimensional) did not turn up any promising leads.
So, I'm thinking that there is not a description of a 3+ dimensional jump point search. Your best bet, though, is to drop either Harabor or Grastien a brief, well-worded email asking this same question. If your problem is intriguing enough, perhaps they'll solve the problem and rake up another publication.