Range Searching Data Structures with Cache Locality

Range Searching Data Structures with Cache Locality

This thesis focuses on range searching data structures, an elementary problem in computational geometry with research spanning decades. These problems often involve very large data sets. Processor speeds increase faster than memory speeds, thus the gap between the rate at which CPUs can process data...

Full description

Bibliographic Details
Main Author: Hamilton, Christopher
Language:en
Published: 2011
Subjects:
computational geometry
range searching
range counting
approximate range counting
external memory
cache oblivious
data structures
algorithms
space-filling curves
Hilbert curve
orthogonal range searching
halfspace range searching
shallow cuttings
lower bounds
Online Access:http://hdl.handle.net/10222/13363

Internet

http://hdl.handle.net/10222/13363

Similar Items