期刊文献+

Hilbert packed R树在空中交通管制GIS显示中的研究与应用 被引量:2

Research and application of Hilbert packed R-tree in ATC GIS display
下载PDF
导出
摘要 现有空中交通管制(ATC)地理信息系统(GIS)重绘时遍历整个地图模型来绘制所有图元,影响了地图显示的速度。针对这一问题,设计了基于Hilbert packed R树的地图绘制算法,首先为每一个图层建立Hilbert packed R树索引,以此为基础每次重绘时采用深度优先遍历的绘制方法重绘地图。试验结果表明,该算法有效地提高了地图显示的速度。 The present Air Traffic Control (ATC) Geographical Information System (GIS) is very slow in displaying the map due to traversing the whole model to draw all units. Concerning this, some work was done on the mapping algorithm based on the Hilbert packed R-tree: establishing Hilbert packed R-tree index for each layer, and redrawing the map using depth-first traversing method. The experimental resuhs indicate that the proposed algorithm can achieve faster displaying speed.
出处 《计算机应用》 CSCD 北大核心 2009年第9期2589-2592,共4页 journal of Computer Applications
基金 国家自然科学基金资助项目(60705005) 教育部博士点基金资助项目(20070610031) 四川省应用基础研究项目(2008JY0038)
关键词 空中交通管制 地理信息系统 HILBERT packed R树 Hilbert码 深度优先遍历 地图重绘 Air Traffic Control (ATC) Geographical Information System (GIS) Hilbert packed R tree Hilbert code depth-first traversal redrawing map
  • 相关文献

参考文献6

  • 1KAMEL I, FALOUTSOS C. On packing R-trees [ C]// Proceedings of the 2nd International Conference on Information and Knowledge Management. New York: ACM Press, 1993:490-499. 被引量:1
  • 2李晨阳,张杨,冯玉才.N维Hilbert编码的计算[J].计算机辅助设计与图形学学报,2006,18(7):1032-1038. 被引量:6
  • 3MOON B, JAGADISH H V, FALOUTSOS C, et al. Analysis of the clustering properties of the Hilbert space-filling curve [ J]. IEEE Transactions on Knowledge and Data Engineering, 2001, 13 ( 1 ) : 124 - 141. 被引量:1
  • 4陆锋,周成虎.一种基于空间层次分解的Hilbert码生成算法[J].中国图象图形学报(A辑),2001,6(5):465-469. 被引量:22
  • 5BRINKHOFF T, KRIEGEL H P, SEEGER B. Efficient processing of spatial joins using R-trees [ C]// Proceedings of the 1993 ACM SIGMOD Conference on Management of Data. New York: ACM Press, 1993:237-246. 被引量:1
  • 6张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:95

二级参考文献119

  • 1顾其钧,杨海浪,赵锐,赵宏,何隆华.皮亚诺扫描分形基图像编码与压缩[J].环境遥感,1993,8(4):300-305. 被引量:4
  • 2Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394~408. 被引量:1
  • 3An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368~375. 被引量:1
  • 4Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609~626. 被引量:1
  • 5Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195~204. 被引量:1
  • 6Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225~236. 被引量:1
  • 7Koudas N., Faloutsos C., Kamel I.. Declustering spatial databases on a multi-computer architecture. In: Proceedings of EDBT, Avignon, France, 1996, 592~614. 被引量:1
  • 8Brinkhoff T., Kriegel Hans-Peter, Seeger B.. Parallel processing of spatial joins using R-trees. In: Proceedings of ICDE, New Orleans, Louisiana, 1996, 258~265. 被引量:1
  • 9Papadopoulos A., Manolopoulos Y.. Parallel processing of nearest neighbor queries in declustered spatial data. In: Proceedings of ACM-GIS, Rockville, MD, 1996, 35~43. 被引量:1
  • 10Papadopoulos A., Manolopoulos Y.. Nearest neighbor queries in shared-nothing environments. Geoinformatica, 1997, 1(4): 369~392. 被引量:1

共引文献120

同被引文献9

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:95
  • 2Leutenegger S,Edgington J M,Lopez M A.STR:A simple and efficient algorithm for R-tree packing[C].Birminghan,England:Proceedings of the 13th IEEE ICDE,1997:497-506. 被引量:1
  • 3Lee T,Sukho.OMT:Overlap minimizing top-aown bulk loading algorithm for R-tree[J].Advanced Information Systems Engineering,2003(7):69-72. 被引量:1
  • 4张明波,陆锋,申排伟,等.空间索引R树研究:回顾与展望[C].北京:中国地理信息系统协会第八届年会,2004:22-27. 被引量:1
  • 5Lee T,Bongki M,Lee S.Bulk Insertion for R-tree by Seeded Clustering[C]//Proc.of DEXA’03.Prague,Czech Republic: [s.n.],2003. 被引量:1
  • 6Lee T,Lee S.OMT: Overlap Minimizing Top-down Bulk Loading Algorithm for R-tree[J].Advanced Information Systems Engineering,2003,11(7): 69-72. 被引量:1
  • 7Leutenegger S,Edgington J M,Lopez M A.STR: A Simple and Efficient Algorithm for R-tree Packing[C]//Proc.of ICDE’07.Birmingham,UK: [s.n.],1997. 被引量:1
  • 8周芹,钟耳顺,黄耀欢.基于分区技术的静态R树索引并行计算技术[J].计算机工程,2009,35(2):68-69. 被引量:4
  • 9来琳涵,刘志镜,闫立伟.使用R树进行k-NN搜索[J].计算机工程与设计,2002,23(9):77-80. 被引量:2

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部