If I am given two points the shortest path between them is a straight line. However, I am told there exists some path between Point A and Point B that is d long. I believe there is technically an infinite amount of paths one could take from point A to point B that is d long. However, I believe it is possible to calculate a shape that represents the total domain of all these paths.
Currently, I have considered modifying the trajectory of a projectile function or calculating an arc circle between the two points based on the known distance.
I was wondering if anyone on the stack exchange community had heard of such a thing or if they know if such a thing is possible. I also do not know if this question meets community guidelines so please let me know if I can improve upon it.