This paper presents an efficient algorithm for finding the diameter of a point set on mesh-connected parallel computers. The running time of the algorithm is $O(n^{**}(1/2)^*\log (n))$.