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

09/15/2021
by   Boris Aronov, et al.
0

We present subquadratic algorithms in the algebraic decision-tree model for several 3Sum-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane, and a set C of n triangles in the plane, we want to count, for each triangle Δ∈ C, the number of intersection points between the segments of A and those of B that lie in Δ. The problems considered in this paper have been studied by Chan (2020), who gave algorithms that solve them, in the standard real-RAM model, in O((n^2/log^2n)log^O(1)log n) time. We present solutions in the algebraic decision-tree model whose cost is O(n^60/31+ε), for any ε>0. Our approach is based on a primal-dual range searching mechanism, which exploits the multi-level polynomial partitioning machinery recently developed by Agarwal, Aronov, Ezra, and Zahl (2020). A key step in the procedure is a variant of point location in arrangements, say of lines in the plane, which is based solely on the order type of the lines, a "handicap" that turns out to be beneficial for speeding up our algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2020

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets

We present subquadratic algorithms, in the algebraic decision-tree model...
research
12/04/2018

Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time -- a proof by reduction from epsilon-closeness

We consider the problem of computing, given a set S of n points in the p...
research
11/05/2021

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

We revisit Hopcroft's problem and related fundamental problems about geo...
research
02/09/2018

Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchmáros curve

In this paper we investigate the number of minimum weight codewords of s...
research
03/05/2020

Optimal Discretization is Fixed-parameter Tractable

Given two disjoint sets W_1 and W_2 of points in the plane, the Optimal ...
research
03/26/2020

Geometric Pattern Matching Reduces to k-SUM

We prove that some exact geometric pattern matching problems reduce in l...
research
12/20/2017

Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

Suppose we have an arrangement A of n geometric objects x_1, ..., x_n ⊆R...

Please sign up or login with your details

Forgot password? Click here to reset