research
∙
08/13/2022
Intersection Searching amid Tetrahedra in Four Dimensions
We develop data structures for intersection queries in four dimensions t...
share
research
∙
03/19/2022
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...
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
∙
02/15/2021
On Ray Shooting for Triangles in 3-Space and Related Problems
We consider several problems that involve lines in three dimensions, and...
research
∙
12/08/2020
On rich lenses in planar arrangements of circles and related problems
We show that the maximum number of pairwise non-overlapping k-rich lense...
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
∙
04/21/2019
Constructive Polynomial Partitioning for Algebraic Curves in R^3 with Applications
In 2015, Guth proved that for any set of k-dimensional varieties in R^d ...
research
∙
12/26/2018
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Guth showed that given a family S of n g-dimensional semi-algebraic sets...
research
∙
02/24/2018
On Pseudo-disk Hypergraphs
Let F be a family of pseudo-disks in the plane, and P be a finite subset...
research
∙
12/08/2017
