在状态栏上显示地图坐标！本人是用arcgis server开发的。大家努力啦！...

基于ArcGis 10.2 Engine, 桌面程序，比ArcGis Map快很多基于ArcGis 10.2 Engine, 桌面程序。比打开ArcGis Map快很多，是做基于桌面程序的很好的起点，在此基础上扩展相应功能。可处理MXD文件，有基础图形工具。程序中顶部是工具条，下部左是图层控制窗，有菜单开关；下部右是地图控件。

Intersect_Tins.rar. 实现不规则三角网的内插。　求取其截面等。-Intersect_Tins.rar. realization irregular triangular net interpolation. Asks to take its section and so on.

多面函数法进行曲面模拟，并在查找论文的基础上进行优化。原创。-multidimensional function method for simulation of surface, and search for papers on the basis of optimization. Originality.

山西省太原09年最新矢量地图(MapInfo格式)-Taiyuan, Shanxi Province in 2009 the latest vector map (MapInfo format)

利用Mapx+Delphi编写电子地图的实例，自己变成时可直接放置mapx控件，这样更简单-Mapx Delphi use electronic maps example, when they become mapx placed directly controls, which is more simple

一个GIS的程序, 一个GIS的程序,-A GIS procedure, a procedure for GIS, a GIS procedures

就纸质地图等高线计算机自动提取展开讨论，结合计算机图形学、图像处理和模式识别等理论，提出了一套基于VC++开发平台的 具体实现算法。实验表明该方法获得了比较满意的提取效果，可以在GIS和军用仿真领域中进行推广。-on paper maps, contour lines from the computer automatically begun discussions with computer graphics, image processing and pattern recognition theory, a VC-based development platform to the specific algorithm. Experiments show that the method was quite satisfied with the extraction, the GIS and military simulation area for the promotion.

本程序是K条最短路算法测试程序,陈艳艳老师的K条路算法。程序求3条最短路，约束条件值可以设定,约束值越小，多路径共用路段越多。-Article K of the procedure is the shortest path algorithm to test procedures, Yan-Yan Chen K teacher path algorithm. Procedures for the three short-circuit, constraints can be set value, the smaller the value constraint, multi-path section of the more common.

在状态栏上显示地图坐标！本人是用arcgis server开发的。大家努力啦！-In the status bar to display map coordinates! I am using arcgis server development. U.S. efforts to you!

本文结合DCT变换的特性，利用分形的Peano一hilbert扫描曲线，对基于DCT变换的图像编码方法进行了研究，并提出了改进方法。主要工作分为两个部分: 一是在分块DCT基础上的改进。对分块后生成的各图像块矩阵，不直接作二维DCT变换，而是先进行扫描，使之重排成一维向量，再进行一维DCT变换，这样可以减少运算量。 其次是对层次余弦变换编码部分的改进。使用层次DCT变换与零树编码相结合的方法，并在扫描编码过程中，按Peano一hilbert扫描顺序进行编码。这样不仅可以减少“块效应”，而且可以加快编码速度。-this paper the characteristics of DCT, using fractal Peano a Hilbert scanning curve, the DCT-based image coding method for the study and improvement of methods. The work is divided into two main parts : First, the DCT block on the basis of improvements. Right after block production of the image block matrix, not for direct two-dimensional DCT, but first scan, so they line up in a heavy-dimensional vector and then a peacekeeping DCT, thus reducing the amount of computation. Secondly, the level of cosine transform coding some of the improvements. The use level of DCT and zero tree coding combination of methods, coding and scanning process, according to a Hilbert Peano code scanning sequence. This will not only reduce the "blocking