Sign in to follow this  

Pathfinding

This topic is 4519 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I'm looking for a pathfinding algorithm in the following situation: - Obstacles are polygons, which can be convex. - There are static obstacles, and dynamic obstacles such as buildings or dead zones (they don't move but can be destroyed/removed). Now, I choose two points (A and B) on the board and draw a circle around A. I want to find a point C on that circle so that the shortest path from A to B passes through C or, at least, not far from C. I can precompute things on the static obstacles, and perform some computations on dynamic obstacles when they appear or disappear, but I prefer not to compute the entire path from A to B to find point C.

Share this post


Link to post
Share on other sites

This topic is 4519 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this