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

1 |
Optimal Volume-Sensitive Bounds for Polytope Approximation |
Arya, Sunil et al. |
2023 |

2 |
Smooth Distance Approximation |
Abdelkader, Ahmed et al. |
2023 |

3 |
Voronoi Diagrams in the Hilbert Metric |
Gezalyan, Auguste H. et al. |
2023 |

4 |
Approximate Nearest-Neighbor Search for Line Segments |
Abdelkader, Ahmed et al. |
2021 |

5 |
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification |
Flores-Velazco, Alejandro et al. |
2021 |

6 |
Coresets for the Nearest-Neighbor Rule |
Flores-Velazco, Alejandro et al. |
2020 |

7 |
Online Algorithms for Warehouse Management |
Dasler, Philip et al. |
2019 |

8 |
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums |
Arya, Sunil et al. |
2018 |

9 |
Economical Delone Sets for Approximating Convex Bodies |
Abdelkader, Ahmed et al. |
2018 |

10 |
Near-Optimal epsilon-Kernel Construction and Related Problems |
Arya, Sunil et al. |
2017 |

11 |
On the Combinatorial Complexity of Approximating Polytopes |
Arya, Sunil et al. |
2016 |

12 |
Approximate Geometric MST Range Queries |
Arya, Sunil et al. |
2015 |

13 |
Space Exploration via Proximity Search |
Har-Peled, Sariel et al. |
2015 |