Description: 这就是陈建春的《用Visual C++开发GIS系统》的配套代码。
用来给初学者熟悉VC++图形编程很不错，我当初学MFC的时候就是照着这本书上手的。但作为一个GIS系统来说缺少一些必要的 要素，比如大数据量的管理、空间索引、符号化、投影等等等等等。以现在的眼光看来整个系统的架构设计也不是太好。
这本书再版后改名为《矢量图形系统开发与编程》，内容变化不大-"using Visual C development of GIS systems" supporting code. For beginners to the VC familiar with graphical programming quite well, and I had the time to learn MFC is shining on this book in the business. But as a GIS systems lack the necessary elements, such as the large amount of data management, spatial indexing, symbols, such as projectors, etc.. Now the point of view of the entire system architecture design is not too good. This book reprinted later renamed as "vector graphics systems development and programming", little change Platform: |
Size: 147108 |
Author:林意 |
Hits:
Description: 这就是陈建春的《用Visual C++开发GIS系统》的配套代码。
用来给初学者熟悉VC++图形编程很不错，我当初学MFC的时候就是照着这本书上手的。但作为一个GIS系统来说缺少一些必要的 要素，比如大数据量的管理、空间索引、符号化、投影等等等等等。以现在的眼光看来整个系统的架构设计也不是太好。
这本书再版后改名为《矢量图形系统开发与编程》，内容变化不大-"using Visual C development of GIS systems" supporting code. For beginners to the VC familiar with graphical programming quite well, and I had the time to learn MFC is shining on this book in the business. But as a GIS systems lack the necessary elements, such as the large amount of data management, spatial indexing, symbols, such as projectors, etc.. Now the point of view of the entire system architecture design is not too good. This book reprinted later renamed as "vector graphics systems development and programming", little change Platform: |
Size: 146432 |
Author:林意 |
Hits:
Description: 空间数据索引技术的描述，初学者可以进行简单的了解-Description of spatial data indexing technology, beginners can be a simple understanding of Platform: |
Size: 195584 |
Author:徐翔 |
Hits:
Description: 目前三角网是进行精细地形表达最好和最常用的方法，因此本文讨论利用三角网法来建立露天矿的精细DEM模型。由于露天矿复杂特殊的地形特征，在建模过程中应充分考虑相应的约束条件，否则会出现台阶被削平等现象。构建不规则三角网的方法可分为分而治之算法、逐点插入算法和三角网生长算法。各种算法各具优缺点，结合矿区的实际情况，本文采用一次性约束三角网生成算法，经过空间数据提取、拓扑关系建立以及空间索引建立，最终建立起边界约束线以内的约束不规则三角网。-At present, triangulated irregular net is the best method of fine landform expression, so the paper discusses applying triangulated irregular net to establish fine DEM of open-pit. Because of complicated landform characteristic, corresponding constraint condition should be considered in building model process, otherwise it will appear phenomenon that flight of steps is cut. The method of triangulated irregular net establishment is detachable for divide and conquer algorithm, piecemeal intervene in algorithm and triangle net growth algorithm. The various algorithm has excellence and shortcoming respectively, combined with the mining area actual situation, this paper adopt the constrained triangulated irregular net once generation algorithm, through spatial data extraction, topological relations generation and spatial indexing generation, constrained triangulated irregular net is generated within boundary line at last. Platform: |
Size: 330752 |
Author:suixin |
Hits:
Description: 本人自己写的，完全可以在VB环境下调试和运行-patial data management has been an activearea of research in the database field for two decades，with much of the research being focused on develop-ing data structures for storing and indexing spatialdata. However, no commercial database system pro-vides facilities for directly defining and storing spa-tial data, and forniulating queries based on researchconditions on spatial data. We believe the followingare the relevant issues on which near-term researchshould be focused (in the order of decreasing impor-tance and urgency)． Platform: |
Size: 413696 |
Author:李超 |
Hits:
Description: 聚类金字塔树-一种新的高维空间数据索引方法
提出了一种新的有效的高维空间数据索引方法 聚类金字塔树.它先对不均匀分布数据进行聚类 处理,然后对聚类的结果实施金字塔分割和存储,由此建立一种有效的索引结构.文中给出了聚类金字塔树的几种查询算法.实验证明:处理不均匀分布数据时,聚 类金字塔树无论在页面访问次数,还是在CPU总占用时间上都优于金字塔树.
-Pyramid Tree Cluster- A new high-dimensional data indexing method presents a new and effective method for high dimensional spatial data indexing- Pyramid clustering tree it first on the uneven distribution of data clustering, and then results clustering implementation pyramid segmentation and storage, thereby establishing an effective index structure paper presents several query clustering algorithm pyramid tree proved: when dealing with the uneven distribution of data, both in the clustering tree pyramid page visits, or in the total of occupied CPU time is better than the pyramid tree. Platform: |
Size: 258048 |
Author:fangsm1 |
Hits:
Search - indexing for spatial data