(adsbygoogle = window.adsbygoogle || []).push({}); Shortest path on dynamic "graph"

Suppose you have n objects orbiting Earth with velocities v1, ..., vn. Starting from t=0, the objects are at positions x1,..., xn; how do you calculate at what point they will be at a state such that the shortest path (arcs of great cirlces) connecting all of them will exist? Is it possible that no such configuration exists (there will always be a shorter one)?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Shortest path on dynamic graph

Loading...

Similar Threads - Shortest path dynamic | Date |
---|---|

I Finding shortest distance between skew lines, checking work. | Aug 4, 2016 |

A check: shortest distance from point to line | Jan 19, 2016 |

Proof the shortest path on a sphere is the great circle. | May 10, 2015 |

Shortest path problem with multiple goals on a grid | Jan 5, 2013 |

Certifying shortest vector in a lattice | Jul 17, 2010 |

**Physics Forums - The Fusion of Science and Community**