Abstract: It is intended to prove that the of the optimum displaying problems re lated with geometry data solution can be found in polynomial time, under certain condition. After a brief introduction of the background knowledge, this problem is analyzed and its mathematical model and its standards are stated. By transfo rming the problem into the marching problem of bipartite graph, an algorithm is given, which can find the best solution in the polynomial time. Thus the goal is achieved. At the end of this paper, our future work is pointed out also.

Key words: information visualization, multidimensional data, geometry-related dat a, pixel-oriented visualization technique, solvable in polynomial time