[R-sig-Geo] Shortest path around obstacles (OT)

[hadley wickham]

On Sun, Feb 24, 2008 at 12:46 AM, Don MacQueen <macq at llnl.gov> wrote:
> This question is basically off topic, since it isn't truly an R
>  question, though it is certainly related to r-sig-geo. I ask here in
>  the hopes that someone can suggest a direction for me to look.
>
>  I have a what is essentially a floor plan of a building (lines
>  representing walls, breaks in the lines representing doors, and so
>  on). I would like to have an algorithm that can calculate the
>  shortest distance between any two points (actually, large numbers of
>  pairs of points) that does not intersect any line (pass through any
>  wall).

This resource looks like a good start:
http://theory.stanford.edu/~amitp/GameProgramming/

I found this by googling for pathfinding (your task) and a-star (the
name of a pathfinding heuristic) , and if looks like there are many
other good resources on the same topic.

Hadley


-- 
http://had.co.nz/