The following pages link to Esther Ezra (Q407568):
Displaying 48 items.
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\) (Q866969) (← links)
- On the performance of the ICP algorithm (Q934025) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing (Q1940703) (← links)
- Geometric optimization revisited (Q2075763) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- Time and space efficient collinearity indexing (Q2678263) (← links)
- (Q2934012) (← links)
- On the union of fat tetrahedra in three dimensions (Q3455564) (← links)
- (Q3601527) (← links)
- On regular vertices on the union of planar objects (Q3602877) (← links)
- A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (Q4580116) (← links)
- On the Beck-Fiala Conjecture for Random Set Systems (Q4636462) (← links)
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
- Counting and Cutting Rich Lenses in Arrangements of Circles (Q5071100) (← links)
- (Q5088930) (← links)
- On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
- Small-size ε-nets for axis-parallel rectangles and boxes (Q5172760) (← links)
- Small-size relative ( <i>p</i> ,ε)-approximations for well-behaved range spaces (Q5174483) (← links)
- On the Beck‐Fiala conjecture for random set systems (Q5229336) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in ℝ<sup>3</sup> with Applications (Q5236353) (← links)
- Output-Sensitive Construction of the Union of Triangles (Q5317199) (← links)
- Counting and representing intersections among triangles in three dimensions (Q5361673) (← links)
- (Q5365154) (← links)
- Two Proofs for Shallow Packings (Q5368679) (← links)
- Almost tight bound for a single cell in an arrangement of convex polyhedra in R <sup>3</sup> (Q5370592) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q5370696) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5384063) (← links)
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes (Q5390595) (← links)
- Convex hull of imprecise points in <i>o(n log n)</i> time after preprocessing (Q5404402) (← links)
- Improved Bounds for the Union of Locally Fat Objects in the Plane (Q5494929) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)
- Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. (Q6059955) (← links)
- (Q6187787) (← links)
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems (Q6539521) (← links)
- Line intersection searching amid unit balls in 3-space (Q6620491) (← links)
- Vertical decomposition in 3D and 4D with applications to line nearest-neighbor searching in 3D (Q6645350) (← links)
