## External-Memory Algorithms with Applications in Geographic Information Systems (1997)

Venue: | Algorithmic Foundations of GIS |

Citations: | 27 - 9 self |

### BibTeX

@INPROCEEDINGS{Arge97external-memoryalgorithms,

author = {Lars Arge},

title = {External-Memory Algorithms with Applications in Geographic Information Systems},

booktitle = {Algorithmic Foundations of GIS},

year = {1997},

pages = {213--254},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing Input/Output (I/O) communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this note we survey the recent developments in external-memory algorithms with applications in GIS. First we discuss the Aggarwal-Vitter I/O-model and illustrate why normal internal-memory algorithms for even very simple problems can perform terribly in an I/O-environment. Then we describe the fundamental paradigms for designing I/O-efficient algorithms by using them to design efficient sorting algorithms. We then go on and survey external-memory algorithms for computational geometry problems -- with special emphasis on problems with applications in GIS -- and techniques for designing such algorithms: Using the orthogonal line segment intersection problem we illustrate the distribution-sweeping and ...