Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures

10/18/2022
by   Timothy M. Chan, et al.
0

We revisit the classic problem of simplex range searching and related problems in computational geometry. We present a collection of new results which improve previous bounds by multiple logarithmic factors that were caused by the use of multi-level data structures. Highlights include the following: ∙ For a set of n points in a constant dimension d, we give data structures with O(n^d) (or slightly better) space that can answer simplex range counting queries in optimal O(log n) time and simplex range reporting queries in optimal O(log n + k) time, where k denotes the output size. For semigroup range searching, we obtain O(log n) query time with O(n^d polylogn) space. Previous data structures with similar space bounds by Matoušek from nearly three decades ago had O(log^d+1n) or O(log^d+1n + k) query time. ∙ For a set of n simplices in a constant dimension d, we give data structures with O(n) space that can answer stabbing counting queries (counting the number of simplices containing a query point) in O(n^1-1/d) time, and stabbing reporting queries in O(n^1-1/d+k) time. Previous data structures had extra log^d n factors in space and query time. ∙ For a set of n (possibly intersecting) line segments in 2D, we give a data structure with O(n) space that can answer ray shooting queries in O(√(n)) time. This improves Wang's recent data structure [SoCG'20] with O(nlog n) space and O(√(n)log n) query time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2020

Four-Dimensional Dominance Range Reporting in Linear Space

In this paper we study the four-dimensional dominance range reporting pr...
research
03/25/2020

Further Results on Colored Range Searching

We present a number of new results about range searching for colored (or...
research
02/25/2020

Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments

In this paper, we first consider the subpath convex hull query problem: ...
research
01/28/2020

Path Query Data Structures in Practice

Let us be given an ordinal tree, such that each node of it has a certain...
research
05/04/2023

On Range Summary Queries

We study the query version of the approximate heavy hitter and quantile ...
research
09/25/2019

Internal Dictionary Matching

We introduce data structures answering queries concerning the occurrence...
research
03/23/2018

Parallel Range and Segment Queries with Augmented Maps

The range and segment query problems are fundamental problems in computa...

Please sign up or login with your details

Forgot password? Click here to reset