You can also automate that process, but I’m not sure about your setup.
Regardless of how you decide to place the points, in runtime you get an ultra-fast and reliable solution.
You might also want to check out my MinMax comparators for vectors to quickly find the nearest/farthest among some arbitrary points in space. (You can just copy/paste that code in a separate file and the methods will appear on all your Vector2’s as extensions once you add using MinMaxing;
to the header.)