Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
for a geo-based online game I’m looking for an algorithm which finds the shortest distance between a specified point and a known path connected by x/y-coordinates, so that I can kill all redundant points/nodes. A link or keyword for this algorithm would help me a lot! thanks for reading
For better understanding:
Are you wanting to calculate this in order to say something like “if the point-to-path distance is zero, then remove the point”? If so, then there is probably an easier way to remove redundant nodes. Take the points three at a time (call them
A,B, andC). Calculate the angle betweenAandB, as well as the angle betweenBandC. If the two angles are the same, then pointBlies in the path betweenAandCand is redundant. You can use the ‘atan2’ function (or your language’s equivalent) to do the angle calculations.