Coursework - Advanced Algorithms, MEng @ M&CS WUT, Spring 2018
Problem: On a golf course there are n balls and n holes, n golfers want to simultaneuosly place each ball into any of the holes. In order to do that, they arrange between themselves, who is aiming which hole, but in a way that any ball trajectory does not intersect with another. It guarantees lack of collisions.
Given that balls and holes are points on a surface, any three of them are collinear and ball trajectories are segments of straight lines, present the algorithm assigning balls to holes, which will guarantee that any two of ball trajectories are not intersecting. The algorithm should have time complexity.
More details, including proofs, are enclosed in the documentation (polish only).