An algorithm for solving the dominance query of a set of points in the plain on a 2-dimensional mesh computer is given; and its correction and time complexity are analysized.

• 给出了在二维网格计算机上求平面点集的点优势询问算法，并分析了算法的正确性和时间复杂性。