Tag Info

New answers tagged

0

Update solution: Even though I was inspired by Andrew Russell's solution. For anyone interested. I've solved it in the end as such. 1) I first detect intersection (point I) with graph (or multiple graphs afterwards). 2) Then I find point in angle higher than angle from an incoming point (Intersection -> Start). Such point is marked yellow. I'm only ...


13

The problem is with how you are formulating your navigation graph. If you'll allow me to butcher your diagram: Here is what the navigation graph should look like. For each node in the original graph with n edges, where n > 1, it should be replaced with n nodes. (Notice that each node in the graph is connected by two edges.) Inserting start and end nodes ...


5

You're misrepresenting your graph. What you really have is something more like this: Where the red dots are your nodes, and the blue lines are your edges. This can be produced by creating four nodes for every node in your current graph. (There are actually even more edges that would be valid here as you could move diagonally between a number of these ...



Top 50 recent answers are included