A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
1996
BRICS Report Series
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 new external-memory algorithms for a number of important problems involving line segments in the plane, including trapezoid decomposition, batched planar point location, triangulation,
doi:10.7146/brics.v3i12.19975
fatcat:bq343vgbbbhkbgiapamlecawci