Aarhus University Seal / Aarhus Universitets segl

Lars Arge

Cache-Oblivious Planar Orthogonal Range Searching and Counting

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Department of Computer Science
present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching. Our range counting structure uses O(Nlog2 N) space and answers queries using O(logB N) memory transfers, where B is the block size of any memory level in a multilevel memory hierarchy. Using bit manipulation techniques, the space can be further reduced to O(N). The structure can also be modified to support more general semigroup range sum queries in O(logB N) memory transfers, using O(Nlog2 N) space for three-sided queries and O(Nlog22 N/log2log2 N) space for four-sided queries. Based on the O(Nlog N) space range counting structure, we develop a data structure that uses O(Nlog2 N) space and answers three-sided range queries in O(logB N+T/B) memory transfers, where T is the number of reported points. Based on this structure, we present a general four-sided range searching structure that uses O(Nlog22 N/log2log2 N) space and answers queries in O(logB N + T/B) memory transfers.
Original languageEnglish
Title of host publicationProceedings of the twenty-first annual symposium on Computational geometry
Number of pages10
PublisherAssociation for Computing Machinery
Publication year2005
Publication statusPublished - 2005
EventAnnual symposium on Computational geometry. SCG '05 - Pisa, Italy
Duration: 17 Dec 2010 → …
Conference number: 21


ConferenceAnnual symposium on Computational geometry. SCG '05
Periode17/12/2010 → …

See relations at Aarhus University Citationformats

ID: 230294