Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees

11/05/2021
by   Timothy M. Chan, et al.
0

We revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given n points and n lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line pairs in O(n^4/3) time, which matches the conjectured lower bound and improves the best previous time bound of n^4/32^O(log^*n) obtained almost 30 years ago by Matoušek. We describe two interesting and different ways to achieve the result: the first is randomized and uses a new 2D version of fractional cascading for arrangements of lines; the second is deterministic and uses decision trees in a manner inspired by the sorting technique of Fredman (1976). The second approach extends to any constant dimension. Many consequences follow from these new ideas: for example, we obtain an O(n^4/3)-time algorithm for line segment intersection counting in the plane, O(n^4/3)-time randomized algorithms for bichromatic closest pair and Euclidean minimum spanning tree in three or four dimensions, and a randomized data structure for halfplane range counting in the plane with O(n^4/3) preprocessing time and space and O(n^1/3) query time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2021

Constructing Many Faces in Arrangements of Lines and Segments

We present new algorithms for computing many faces in arrangements of li...
research
07/28/2020

Counting Short Vector Pairs by Inner Product and Relations to the Permanent

Given as input two n-element sets 𝒜,ℬ⊆{0,1}^d with d=clog n≤(log n)^2/(l...
research
12/04/2020

Near-Optimal Algorithms for Point-Line Covering Problems

We study fundamental point-line covering problems in computational geome...
research
09/15/2021

Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model

We present subquadratic algorithms in the algebraic decision-tree model ...
research
03/26/2020

Geometric Pattern Matching Reduces to k-SUM

We prove that some exact geometric pattern matching problems reduce in l...
research
04/19/2022

Unit-Disk Range Searching and Applications

Given a set P of n points in the plane, we consider the problem of compu...
research
03/20/2019

Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

We present efficient data structures for problems on unit discs and arcs...

Please sign up or login with your details

Forgot password? Click here to reset