GIS AlgorithmsSAGE, 09/11/2015 - 336 páginas Geographic information systems (GIS) have become increasingly important in helping us understand complex social, economic, and natural dynamics where spatial components play a key role. The critical algorithms used in GIS, however, are notoriously difficult to both teach and understand, in part due to the lack of a coherent representation. GIS Algorithms attempts to address this problem by combining rigorous formal language with example case studies and student exercises. Using Python code throughout, Xiao breaks the subject down into three fundamental areas:
|
Índice
| 1 | |
| 9 | |
| 11 | |
CHAPTER 3 POLYGON OVERLAY | 49 |
PART II SPATIAL INDEXING | 69 |
CHAPTER 4 INDEXING | 71 |
CHAPTER 5 KD TREES | 77 |
CHAPTER 6 QUADTREES | 99 |
CHAPTER 9 SPATIAL PATTERN AND ANALYSIS | 177 |
CHAPTER 10 NETWORK ANALYSIS | 211 |
CHAPTER 11 SPATIAL OPTIMIZATION | 228 |
CHAPTER 12 HEURISTIC SEARCH ALGORITHMS | 251 |
POSTSCRIPT | 275 |
A PRIMER | 277 |
APPENDIX B GDALOGR AND PYSAL | 291 |
APPENDIX C CODE LIST | 303 |
CHAPTER 7 INDEXING LINES AND POLYGONS | 112 |
PART III SPATIAL ANALYSIS AND MODELING | 137 |
CHAPTER 8 INTERPOLATION | 139 |
| 307 | |
| 314 | |
Outras edições - Ver tudo
Palavras e frases frequentes
__main__ __name__ adjacent append calculate called chapter child nodes circle code in Listing compute coordinates create data set data structure data1 DCEL dist edges elif endpoints entries example extent Figure Floyd–Warshall algorithm GDAL greedy algorithm half-edges half-line implement import numpy indexing input insert interpolation intersection point inverse distance weighted iteration k-D tree K-function kriging latitude leaf node line segments list comprehension Matplotlib matrix MBRs median method Mollweide projection Moran’s nearest neighbor distance number of points NumPy numpy as np objective function optimal solution Output overlay p-median problem point import point quadtree polygon PR k-D tree Python program quadrants quadtree R-tree random range query range(n region result Robinson projection root semivariance shapefile shortest path simulated annealing specifically update variable vertices weight Write a Python xmax xmin ymax ymin