| 与地理相关数据的最优显示问题在多项式时间内可解 |
| |
| 引用本文： | 吕天阳,王钲旋,庞云阶.与地理相关数据的最优显示问题在多项式时间内可解[J].吉林大学学报(理学版),2003,41(2):186-191. |
| |
| 作者姓名： | 吕天阳 王钲旋 庞云阶 |
| |
| 作者单位： | 吉林大学计算机科学与技术学院, 长春 130012 |
| |
| 基金项目： | 教育部博士点基金(批准号:20010183041). |
| |
| 摘 要： | 证明在一定条件下， 与地理相关数据的最优显示问题在多项式时间内可解. 通过分 析最优显示问题, 给出它的数学模型及评价标准. 并把它转化为二分图匹配问题, 给出了算 法. 这个算法可以在多项式时间内求得最优解.
|
| 关 键 词： | 信息可视化 高维数据 与地理相关数据 基于像素的可视化技术 多项式时间可解 |
| 文章编号： | 1671-5489(2003)02-0186-06 |
| 收稿时间： | 2002-09-05 |
| 修稿时间： | 2002年9月5日 |
The Optimised Visualization of the Geometry-related Data in Polynomial Time |
| |
| LU Tian-yang,WANG Zheng-xuan,PANG Yun-jie.The Optimised Visualization of the Geometry-related Data in Polynomial Time[J].Journal of Jilin University: Sci Ed,2003,41(2):186-191. |
| |
| Authors: | LU Tian-yang WANG Zheng-xuan PANG Yun-jie |
| |
| Affiliation: | College of Computer Science and Technology, Jilin University, Changchun 130012, China |
| |
| 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. |
| |
| Keywords: | information visualization multidimensional data geometry-related data pixel-oriented visualization technique solvable in polynomial time |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《吉林大学学报(理学版)》下载全文 |
