Find support point of polytope using hill climbing (Collision Detection)

Question

I need to calculate the furthest point in a direction, so the supporting point. We should iterate through the neighbours. But how should I do that with the given things sinc