I started this project since leaving University and the goal of the project was if given a text file that provided locations in a 10,000,000 by 10,000,000 grid to find which of those points was the most isolated. For example the data set might be:
place0 1312573 8418602
place1 4038083 9103890
place2 8899296 9013490
place3 988534 8667395
place4 2810125 1002710
place5 4023834 4748684
place6 8637793 2528606
The program would then find which of the 6 places is the most isolated, ie its closest point is further away than any other point’s closest point. In this instance the answer would be output as “place6 8637793 2528606”.
The program gives the option to be multi-threaded using a task based system and gives two test cases, a small one with 6 locations and a much larger test case with 10,000 points.
Below is the github of the project.
Finlay McGrath 