>Just one question : how do you extend the concept to a node based graph, rather than cell based map ?
>Nice idea, though
Ahw, i dunno what are you questioning me (''cause my bad english i suppose

)
IF you''re questioning me about how i make the beacons + adjacents (they''re like a graph of nodes), first i calculate all the beacons (using a "check corner" algorithm), and next i calculate with bresenhams the adjacent beacons for every beacon (and voilá!, the graph is done

)
IF you''re questioning me about extending the "beacons algorithm" to a node based graph... I suppose I can''t extend it, since all the nodes are like "corners", ''cause they discover new ways.
Hoping to be useful
Rodrigo (1/2 RRC²Soft)