Back to problems

Determine if chasing points will meet

Algorithm · Disney · Hard

There are N points in the plane, indexed from 0 to N-1, arranged as a closed cyclic chain. At time t = 0, point i is located at coordinates (xi, yi). All points begin moving simultaneously and continuously at the same constant speed 1. Each point always heads directly toward the current location of its successor, point (i+1) mod N. Determine whether all points will ever occupy a single common location at a single common time. If this happens, print the meeting time T and the…

Checking your access…