| Publication | Date of Publication | Type |
|---|
| Semi-algebraic off-line range searching and biclique partitions in the plane | 2025-11-24 | Paper |
| Vertical decomposition in 3D and 4D with applications to line nearest-neighbor searching in 3D | 2024-11-28 | Paper |
| Line intersection searching amid unit balls in 3-space | 2024-10-16 | Paper |
| Intersection queries for flat semi-algebraic objects in three dimensions and related problems | 2024-05-14 | Paper |
| Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model | 2024-01-15 | Paper |
| Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. | 2023-11-02 | Paper |
Time and space efficient collinearity indexing
Computational Geometry | 2023-01-09 | Paper |
Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
Discrete & Computational Geometry | 2022-12-08 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
On ray shooting for triangles in 3-space and related problems
SIAM Journal on Computing | 2022-07-22 | Paper |
| scientific article; zbMATH DE number 7559205 (Why is no real title available?) | 2022-07-18 | Paper |
Counting and Cutting Rich Lenses in Arrangements of Circles
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
| On 3SUM-hard problems in the decision tree model | 2022-03-22 | Paper |
| Geometric optimization revisited | 2022-02-16 | Paper |
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
SIAM Journal on Computing | 2021-05-27 | Paper |
On pseudo-disk hypergraphs
Computational Geometry | 2021-01-07 | Paper |
| On rich lenses in planar arrangements of circles and related problems | 2020-12-07 | Paper |
Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
SIAM Journal on Computing | 2020-12-04 | Paper |
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
Discrete & Computational Geometry | 2020-06-16 | Paper |
Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the Beck-Fiala conjecture for random set systems
Random Structures & Algorithms | 2019-08-14 | Paper |
A size-sensitive discrepancy bound for set systems of bounded primal shatter dimension
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
Discrete & Computational Geometry | 2019-05-21 | Paper |
| A nearly quadratic bound for the decision tree complexity of \(k\)-SUM | 2018-08-13 | Paper |
On the Beck-Fiala conjecture for random set systems
(available as arXiv preprint) | 2018-04-19 | Paper |
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
| Two proofs for shallow packings | 2017-10-10 | Paper |
| Improved bound for the union of fat triangles | 2017-09-29 | Paper |
Counting and representing intersections among triangles in three dimensions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Two proofs for shallow packings
Discrete & Computational Geometry | 2016-12-20 | Paper |
A size-sensitive discrepancy bound for set systems of bounded primal shatter dimension
SIAM Journal on Computing | 2016-02-05 | Paper |
On the union of fat tetrahedra in three dimensions
Journal of the ACM | 2015-12-07 | Paper |
Small-size relative ( p ,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| Active learning using smooth relative regret approximations with applications | 2014-12-08 | Paper |
Active learning using smooth relative regret approximations with applications
(available as arXiv preprint) | 2014-12-08 | Paper |
Improved bounds for the union of locally fat objects in the plane
SIAM Journal on Computing | 2014-07-30 | Paper |
Convex hull of imprecise points in \(o(n \log n)\) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
Computational Geometry | 2013-03-07 | Paper |
Near-linear approximation algorithms for geometric hitting sets
Algorithmica | 2012-04-26 | Paper |
A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
Information Processing Letters | 2012-03-27 | Paper |
Small-size \(\varepsilon\)-nets for axis-parallel rectangles and boxes
SIAM Journal on Computing | 2011-04-04 | Paper |
On the union of cylinders in three dimensions
Discrete & Computational Geometry | 2011-03-10 | Paper |
On regular vertices of the union of planar convex objects
Discrete & Computational Geometry | 2009-05-13 | Paper |
On regular vertices on the union of planar objects
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506197 (Why is no real title available?) | 2009-02-10 | Paper |
On the performance of the ICP algorithm
Computational Geometry | 2008-07-29 | Paper |
A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)
Discrete & Computational Geometry | 2007-02-14 | Paper |
Counting and representing intersections among triangles in three dimensions
Computational Geometry | 2005-11-01 | Paper |
Output-Sensitive Construction of the Union of Triangles
SIAM Journal on Computing | 2005-09-16 | Paper |
