External-Memory Algorithms for Processing Line Segments in Geographic Information Systems

Authors:
Lars Arge;Darren Erik Vengroff;Jeffrey Scott Vitter
Affiliations:
Department of Computer Science, University of Aarhus, 8200, Aarhus N, Denmark;Pelago, Inc., Seattle, WA 98118, USA;Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 15

I/O-efficient dynamic point location in monotone planar subdivisions

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
External Memory Algorithms

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Distribution sort with randomized cycling

Journal of the ACM (JACM)
External memory planar point location with logarithmic updates

Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
Cache-Oblivious Red-Blue Line Segment Intersection

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions

Computational Geometry: Theory and Applications
I/O-efficient point location in a set of rectangles

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Online visualization of urban noise in ubiquitous-city middleware

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
I/O-efficient batched union-find and its applications to terrain analysis

ACM Transactions on Algorithms (TALG)
External-memory algorithms and data structures

Algorithms and theory of computation handbook
An efficient strategy for storing and searching binary trees in WORM external memory

Journal of Information Science
Efficient viewshed computation on terrain in external memory

Geoinformatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing 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 paper we develop efficient external-memory algorithms for a number of important problems involving line segments in the plane, including trapezoid decomposition, batched planar point location, triangulation, red--blue line segment intersection reporting, and general line segment intersection reporting. In GIS systems the first three problems are useful for rendering and modeling, and the latter two are frequently used for overlaying maps and extracting information from them.