I would like to know how to find path in a graph while having the edges "double-sided". Consider this scenario:
I have list of the line segments. These represents "walls" or rather impassable edges (in a game). I then plan in a next step to build a connected graphs (where possible). I'm trying to determine the feasibility at this point. If there's even a solution to this (it should in my opinion).
I don't need to know about A* or other algorithms per se, but rather how to not walk through the walls as seen in figure B. Any ideas?
I was wondering if I could turn segments to polygons (by adding width). Then make an union of these polygons and then treat them rather as polygons. But I would like to know whether there is a way to do it without this hassle. Also I'm not sure I want to add any width to the lines necessarily.