We present an O(n log n)-time deterministic algorithm for the planar two-center problem, which matches the known lower bound and resolves a longstanding open problem.
