No. |
Title |
Author |
Year |
---|

1 |
Improved Algebraic Degeneracy Testing |
Cardinal, Jean et al. |
2023 |

2 |
Covering Points by Hyperplanes and Related Problems |
Patáková, Zuzana et al. |
2022 |

3 |
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems |
Agarwal, Pankaj K. et al. |
2022 |

4 |
Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection |
Ezra, Esther et al. |
2022 |

5 |
On Reverse Shortest Paths in Geometric Proximity Graphs |
Agarwal, Pankaj K. et al. |
2022 |

6 |
On Ray Shooting for Triangles in 3-Space and Related Problems |
Ezra, Esther et al. |
2021 |

7 |
On Rich Lenses in Planar Arrangements of Circles and Related Problems |
Ezra, Esther et al. |
2021 |

8 |
On Rich Points and Incidences with Restricted Sets of Lines in 3-Space |
Sharir, Micha et al. |
2021 |

9 |
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model |
Aronov, Boris et al. |
2021 |

10 |
Throwing a Sofa Through the Window |
Halperin, Dan et al. |
2021 |

11 |
How to Find a Point in the Convex Hull Privately |
Kaplan, Haim et al. |
2020 |

12 |
Incidences Between Points and Curves with Almost Two Degrees of Freedom |
Sharir, Micha et al. |
2020 |

13 |
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets |
Aronov, Boris et al. |
2020 |

14 |
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem |
Aiger, Dror et al. |
2019 |

15 |
On the Complexity of the k-Level in Arrangements of Pseudoplanes |
Sharir, Micha et al. |
2019 |

16 |
Triangles and Girth in Disk Graphs and Transmission Graphs |
Kaplan, Haim et al. |
2019 |

17 |
Approximate Minimum-Weight Matching with Outliers Under Translation |
Agarwal, Pankaj K. et al. |
2018 |

18 |
Stabbing Pairwise Intersecting Disks by Five Points |
Har-Peled, Sariel et al. |
2018 |

19 |
Union of Hypercubes and 3D Minkowski Sums with Random Sizes |
Agarwal, Pankaj K. et al. |
2018 |

20 |
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM |
Ezra, Esther et al. |
2017 |

21 |
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats |
Agarwal, Pankaj K. et al. |
2017 |

22 |
Dominance Product and High-Dimensional Closest Pair under L_infty |
Gold, Omer et al. |
2017 |

23 |
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier |
Gold, Omer et al. |
2017 |

24 |
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points |
Kaplan, Haim et al. |
2017 |

25 |
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy |
Gold, Omer et al. |
2017 |

26 |
Output Sensitive Algorithms for Approximate Incidences and Their Applications |
Aiger, Dror et al. |
2017 |

27 |
The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk) |
Sharir, Micha |
2017 |

28 |
Incidences between Points and Lines in Three Dimensions |
Sharir, Micha et al. |
2015 |

29 |
Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited |
Raz, Orit E. et al. |
2015 |

30 |
The Number of Unit-Area Triangles in the Plane: Theme and Variations |
Raz, Orit E. et al. |
2015 |