Esther Ezra

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Lower Envelopes of Surface Patches in 3-Space.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Time and space efficient collinearity indexing.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Line Intersection Searching Amid Unit Balls in 3-Space.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Counting and Cutting Rich Lenses in Arrangements of Circles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

On Ray Shooting for Triangles in 3-Space and Related Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Intersection Searching amid Tetrahedra in Four Dimensions.

[BibT_eX]

[DOI]

CoRR, 2022

Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

On pseudo-disk hypergraphs.

[BibT_eX]

[DOI]

Comput. Geom., 2021

On Rich Lenses in Planar Arrangements of Circles and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

On 3SUM-hard Problems in the Decision Tree Model.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

2020

Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications.

[BibT_eX]

[DOI]

Joshua Zahl

SIAM J. Comput., 2020

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Geometric Optimization Revisited.

[BibT_eX]

[DOI]

Kyle Fox

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2017

A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Two Proofs for Shallow Packings.

[BibT_eX]

[DOI]

Kunal Dutta

Arijit Ghosh

Discret. Comput. Geom., 2016

The Decision Tree Complexity for k-SUM is at most Nearly Quadratic.

[BibT_eX]

[DOI]

CoRR, 2016

2015

On the Beck-Fiala Conjecture for Random Set Systems.

[BibT_eX]

[DOI]

Shachar Lovett

Electron. Colloquium Comput. Complex., 2015

Data recovery after geographic correlated attacks.

[BibT_eX]

[DOI]

Swaminathan Sankararaman

Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

2014

Improved Bounds for the Union of Locally Fat Objects in the Plane.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Shallow Packings in Geometry.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Convex hull of points lying on lines in time after preprocessing.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Comput. Geom., 2013

Small-size relative (p, ε)-approximations for well-behaved range spaces.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Active Learning Using Smooth Relative Regret Approximations with Applications.

[BibT_eX]

[DOI]

Nir Ailon

Ron Begleiter

Proceedings of the COLT 2012, 2012

Small-Size Relative (p,Epsilon)-Approximations for Well-Behaved Range Spaces

[BibT_eX]

[DOI]

CoRR, 2012

Near-Linear Approximation Algorithms for Geometric Hitting Sets.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

On the Union of Cylinders in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences

[BibT_eX]

[DOI]

Nir Ailon

Ron Begleiter

CoRR, 2011

Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing

[BibT_eX]

[DOI]

Wolfgang Mulzer

CoRR, 2011

Improved Bound for the Union of Fat Triangles.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Convex hull of imprecise points in o(n log n) time after preprocessing.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

A note about weak epsilon-nets for axis-parallel boxes in d-space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

On the union of fat tetrahedra in three dimensions.

[BibT_eX]

[DOI]

J. ACM, 2009

On Regular Vertices of the Union of Planar Convex Objects.

[BibT_eX]

[DOI]

János Pach

Discret. Comput. Geom., 2009

Small-size epsilon-nets for axis-parallel rectangles and boxes.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Efficient Sensor Placement for Surveillance Problems.

[BibT_eX]

[DOI]

Shashidhara K. Ganjugunte

Proceedings of the Distributed Computing in Sensor Systems, 2009

2008

On the performance of the ICP algorithm.

[BibT_eX]

[DOI]

Alon Efrat

Comput. Geom., 2008

2007

Geometric arrangements: substructures and algorithms

[BibT_eX]

[DOI]

PhD thesis, 2007

A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

On regular vertices on the union of planar objects.

[BibT_eX]

[DOI]

János Pach

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

On the ICP algorithm.

[BibT_eX]

[DOI]

Alon Efrat

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Output-Sensitive Construction of the Union of Triangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Counting and representing intersections among triangles in three dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Almost tight bound for a single cell in an arrangement of convex polyhedra in R3.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Speeding up the incremental construction of the union of geometric objects in practice.

[BibT_eX]

[DOI]

Eti Ezra

Dan Halperin