Hi, I want to implement points of visibility in my pathfinding engine. I've google and I'd like your recommendation.. Thanks Jack

Do you mean just pathsearching using A*, dijkstra?
Or could it be that you wish it to have a ray casted to find the path?

I am assuming you are saying the latter case,
well you could ray-cast the visible region and then storing the visible region into array and trace using A* or other searching algorithm you like.

I had make this topic for my univ 1st year project few years ago using the similar concept i mentioned,
which is by "casting ray" + "A* searching of the visible area".

I still keep track of the vid clip, and is available here :

It sounds like he wants to compute visibility graphs.