artificial intelligence - Line of Sight Algorithm for Graph/Tree search -


i implemented bresenham's line algorithm in python identifying occupancy of grids between noted list of grid cells grid world (say [(1,1), (3,2),(5,6),(8,4) in 10x10 grid world occupied grids) , applied line of sight algorithm check if can skip vertex list in order reduce total distance.

but how can line of sight graph based search ? wonder how can represent tree/graph nodes represented grid cells in coordinate form (x,y) ? suggestions/ideas highly appreciated.


Comments

Popular posts from this blog

android - net_scheduler holding wakelock -

sql - MySQL : Getting Entries from a many-to-many table -

java - Retrieving data from database using jsp (Hibernate + Spring + Maven) -