Chazelle's linear time algorithm for the triangulation of a polygon has not been improved upon since its creation in 1991.

Technically, this is a computer science theorem, but I think it belongs here for a couple reasons. It's complicated. No actual code implementation of the algorithm has ever been made. While it is linear time, the constant factor makes the algorithm useless for any practical purposes, beyond its theoretical use in other papers.