We investigate the naming game on geometric networks.The geometric networks are constructed by adding geometric links to two-dimensional regular lattices.It is found that the agreement time is a non-monotonic function of the geometric distance and there exists an optimal value of the geometric distance resulting in the shortest agreement time.All these results show that the geometric distance plays an important role in the evolutionary process of the language game.Our results also show that the convergence time strongly depends on the number of adding links.