Hello, I'm new to this forum. I was working on a pathfinding algorithm that works for line segment boundaries. It was working well until I noticed that it wont work if the line segments are intersecting somehow. I need: I need to write a pathfinding function that takes in a start point, an end point, and a player's radius. Local boundaries can be loaded from an array. Boundaries can only be line segments. I want something like that, it can be a little less accurate with the curvy rotation around the corner

Hi!

I would solve this in the movement phase instead, simly make the agent turn in that manner.
It doesnt make sense to make the pathfinder smooth it like that - it's up to the presentation of the path.

Just my two cents, thou. :)

/Robert

Do you have a graph or something that constitutes movable locations, or can the "user" move from any point to any other point of which nothing other then a starting point, ending point and walls are defined (meaning you have no connection from point A and point B).