After 2 days, I have finally found a workable solution I am satisfied with!
I will try to give the best and simplest explanation I can, but considering how long the code in question is (link below, but WARNING: extreme spaghetti code), I might miss something important:
To start, the way the stars are set up is very deterministic, since they all inhabit a single sector & are placed in those sectors in ascending order (Star 1 is in sector 1, Star 2 sector 2, etc)
As such, their placement can be formulated into a grid as shown in the top image below.
With this knowledge, it is very easy to get the the active star’s location in relation to every other star. In the bottom image, it is done using Star 9, and also contains the accompanying math for any star shown beside it in notepad:
Using the active star’s name for reference, I can create an array of all the visible surrounding stars as such:
From here, I can get the 2-way length by dividing the distance of the of a nearby star to both the active and ending star by 2, and then add it to an array and draw a line to the shortest 2-way length in the array. If there are no active stars to be drawn to, then I instead go to the next pass; by the final pass, there is guaranteed to be at least one surrounding star:
Finally, the process will repeat until the end star is contained within the surrounding stars:
[Here’s the link to the full code.][6]
Again, expect extreme spaghettification & length xP
More optimal methods might exist, but I’m currently satisfied as is 