> uniform cost grids There are very many grids that do not fit this in real (not... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

striking on June 14, 2015 | parent | context | favorite | on: JPS+ pathfinding – faster than A* [video]

> uniform cost grids

There are very many grids that do not fit this in real (not theoretical) applications. I honestly can't think of when I'd use this algorithm.

mathgenius on June 14, 2015 [–]

Well, yeah, but the whole question of extending this algorithm to arbitrary (weighted) graphs is still very interesting: it seems to rely on some kind of discrete [1] version of parallel transport.

[1] http://ddg.cs.columbia.edu/

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact