与地理相关数据的最优显示问题在多项式时间内可解

The Optimised Visualization of the Geometry-related Data in Po lynomial Time

证明在一定条件下,与地理相关数据的最优显示问题在多项式时间内可解.通过分析最优显示问题,给出它的数学模型及评价标准.并把它转化为二分图匹配问题,给出了算法.这个算法可以在多项式时间内求得最优解.

It is intended to prove that the of the optimum displaying problems related 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 transforming 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.