| Abstract: | New developments in computational geometry are applicable to geographic data processing. Computationally efficient procedures incorporating logarithmic searches over appropriate data structures, and other shortcuts, can yield important savings in computation time and data storage space. There are “fast”methods for two-dimensional problems such as point inclusion, nearest-neighbor and two-nearest-neighbors determination, and grid overlay. Worst-case analysis of algorithms provides useful performance bounds for the developers of geographic production software. |
