
Subquadratic Algorithms for Some 3SumHard Geometric Problems in the Algebraic Decision Tree Model
We present subquadratic algorithms in the algebraic decisiontree model ...
read it

On TwoHanded Planar Assembly Partitioning
Assembly planning, which is a fundamental problem in robotics and automa...
read it

Geometric Pattern Matching Reduces to kSUM
We prove that some exact geometric pattern matching problems reduce in l...
read it

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets
We present subquadratic algorithms, in the algebraic decisiontree model...
read it

On betaPlurality Points in Spatial Voting Games
Let V be a set of n points in ℝ^d, called voters. A point p∈ℝ^d is a plu...
read it

Efficient NearestNeighbor Query and Clustering of Planar Curves
We study two fundamental problems dealing with curves in the plane, name...
read it

Constructive Polynomial Partitioning for Algebraic Curves in R^3 with Applications
In 2015, Guth proved that for any set of kdimensional varieties in R^d ...
read it

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Guth showed that given a family S of n gdimensional semialgebraic sets...
read it

NonMonochromatic and ConflictFree Coloring on Tree Spaces and Planar Network Spaces
It is well known that any set of n intervals in R^1 admits a nonmonochr...
read it

Resolving SINR Queries in a Dynamic Setting
We consider a set of transmitters broadcasting simultaneously on the sam...
read it

On Pseudodisk Hypergraphs
Let F be a family of pseudodisks in the plane, and P be a finite subset...
read it

More TuránType Theorems for Triangles in Convex Point Sets
We study the following family of problems: Given a set of n points in co...
read it
Boris Aronov
is this you? claim profile