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

@article{Arge2006ExternalMemoryAF,
  title={External-Memory Algorithms for Processing Line Segments in Geographic Information Systems},
  author={Lars Arge and Darren Erik Vengroff and Jeffrey Scott Vitter},
  journal={Algorithmica},
  year={2006},
  volume={47},
  pages={1-25}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

A multi-pass algorithm for sorting extremely large data files

2015 6th International Conference on Information and Communication Systems (ICICS) • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 61 references

6 . External Memory Computational Geometry Revisited

Christian Breimann, Jan Vahrenhold
2003
View 9 Excerpts
Highly Influenced

Algorithmic Foundations of GIS

M. van Kreveld, J. Nievergelt, T. Roos, P. W. Eds
Science • 1997
View 16 Excerpts
Highly Influenced

Further Comparison of Algorithms for Geometric Intersection ProblemsD

. S. Andrews, Jack Snoeyink, +6 authors ZhuDepartment
1994
View 14 Excerpts
Highly Influenced

Early experiences in imple- menting the bu er tree

D. Hutchinson, A. Maheshwari, J.-R. Sack, R. Velicescu
Workshop on Algorithm Engineering, • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…