External-memory algorithms for processing line segments in geographic information systems-Reference-Cited by-同舟云学术

External-memory algorithms for processing line segments in geographic information systems

Published:1995 Issue: Volume: Page:295-310
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arge Lars,Vengroff Darren Erik,Vitter Jeffrey Scott

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60313-1_151

Reference28 articles.

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116–1127, Sept. 1988.

2. D. S. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison, and C. Zhu. Further comparisons of algorithms for geometric intersection problems. In Proc. 6th Int'l. Symp. on Spatial Data Handling, 1994.

3. ARC/INFO. Understanding GIS—the ARC/INFO method. ARC/INFO, 1993. Rev. 6 for workstations.

4. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. In Proc. of 4th Workshop on Algorithms and Data Structures, 1995.

5. L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In Proc. of 3rd Workshop on Algorithms and Data Structures, LNCS 709, pages 83–94, 1993.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Data Structures and Algorithms;Wiley Encyclopedia of Computer Science and Engineering;2007-12-14

2. I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions;Algorithms and Computation;2007

3. I/O-Efficient Algorithms on Near-Planar Graphs;LATIN 2006: Theoretical Informatics;2006

4. Lower bounds for intersection searching and fractional cascading in higher dimension;Journal of Computer and System Sciences;2004-03

5. External Memory Data Structures;Massive Computing;2002