Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep

This publication has 17 references indexed in Scilit:

• Orders, k-sets and fast halfplane search on paged memory
  Published by Springer Nature ,2005
• External-memory computational geometry
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• External-memory algorithms for processing line segments in geographic information systems
  Published by Springer Nature ,1995
• Topology B-trees and their applications
  Published by Springer Nature ,1995
• The buffer tree: A new technique for optimal I/O-algorithms
  Published by Springer Nature ,1995
• Memory paging for connectivity and path problems in graphs
  Published by Springer Nature ,1993
• The Maximum Size of Dynamic Data Structures
  SIAM Journal on Computing, 1991
• The input/output complexity of sorting and related problems
  Communications of the ACM, 1988
• Ubiquitous B-Tree
  ACM Computing Surveys, 1979
• Organization and maintenance of large ordered indexes
  Acta Informatica, 1972