DeepAI AI Chat
Log In Sign Up

Lower Bounds for Intersection Reporting among Flat Objects

by   Peyman Afshani, et al.
Aarhus Universitet

Recently, Ezra and Sharir [ES22a] showed an O(n^3/2+σ) space and O(n^1/2+σ) query time data structure for ray shooting among triangles in ℝ^3. This improves the upper bound given by the classical S(n)Q(n)^4=O(n^4+σ) space-time tradeoff for the first time in almost 25 years and in fact lies on the tradeoff curve of S(n)Q(n)^3=O(n^3+σ). However, it seems difficult to apply their techniques beyond this specific space and time combination. This pheonomenon appears persistently in almost all recent advances of flat object intersection searching, e.g., line-tetrahedron intersection in ℝ^4 [ES22b], triangle-triangle intersection in ℝ^4 [ES22b], or even among flat semialgebraic objects [AAEKS22]. We give a timely explanation to this phenomenon from a lower bound perspective. We prove that given a set 𝒮 of (d-1)-dimensional simplicies in ℝ^d, any data structure that can report all intersections with small (n^o(1)) query time must use Ω(n^2(d-1)-o(1)) space. This dashes the hope of any significant improvement to the tradeoff curves for small query time and almost matches the classical upper bound. We also obtain an almost matching space lower bound of Ω(n^6-o(1)) for triangle-triangle intersection reporting in ℝ^4 when the query time is small. Along the way, we further develop the previous lower bound techniques by Afshani and Cheng [AC21, AC22].


page 1

page 2

page 3

page 4


Lower Bounds for Semialgebraic Range Searching and Stabbing Problems

In the semialgebraic range searching problem, we are to preprocess n poi...

On the Hardness of Set Disjointness and Set Intersection with Bounded Universe

In the SetDisjointness problem, a collection of m sets S_1,S_2,...,S_m f...

An Optimal Lower Bound for Simplex Range Reporting

We give a simplified and improved lower bound for the simplex range repo...

Coloring triangle-free L-graphs with O(loglog n) colors

It is proved that triangle-free intersection graphs of n L-shapes in the...

On Ray Shooting for Triangles in 3-Space and Related Problems

We consider several problems that involve lines in three dimensions, and...

A Ptolemaic Partitioning Mechanism

For many years, exact metric search relied upon the property of triangle...

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems

Let 𝒯 be a set of n planar semi-algebraic regions in ℝ^3 of constant com...