Natan Rubin

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 23

Top Topics

Approximate Nearest Neighbor Search

Persistent Homology

Delaunay Triangulation

Top Venues

Discret. Comput. Geom.

Publications

Natan Rubin
An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs. CoRR (2024)
Natan Rubin
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. SODA (2024)
Natan Rubin
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions. CoRR (2024)
Natan Rubin
An Improved Bound for Weak Epsilon-nets in the Plane. J. ACM 69 (5) (2022)
Natan Rubin
Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions. CoRR (2021)
Natan Rubin
Stronger bounds for weak epsilon-nets in higher dimensions. STOC (2021)
Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin
Further Consequences of the Colorful Helly Hypothesis. Discret. Comput. Geom. 63 (4) (2020)
János Pach, Natan Rubin, Gábor Tardos
Planar Point Sets Determine Many Pairwise Crossing Segments. CoRR (2019)
János Pach, Natan Rubin, Gábor Tardos
Planar point sets determine many pairwise crossing segments. STOC (2019)
Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin
Further Consequences of the Colorful Helly Hypothesis. SoCG (2018)
Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin
Further Consequences of the Colorful Helly Hypothesis. CoRR (2018)
Natan Rubin
An Improved Bound for Weak Epsilon-Nets in the Plane. FOCS (2018)
Natan Rubin
An Improved Bound for Weak Epsilon-Nets in the Plane. CoRR (2018)
János Pach, Natan Rubin, Gábor Tardos
A Crossing Lemma for Jordan Curves. CoRR (2017)
Pankaj K. Agarwal, Natan Rubin, Micha Sharir
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. ESA (2017)
János Pach, Natan Rubin, Gábor Tardos
Beyond the Richter-Thomassen Conjecture. SODA (2016)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. Comb. Probab. Comput. 25 (6) (2016)
Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. 54 (4) (2015)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. SODA (2015)
János Pach, Natan Rubin, Gábor Tardos
Beyond the Richter-Thomassen Conjecture. CoRR (2015)
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
Stable Delaunay Graphs. CoRR (2015)
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
Stable Delaunay Graphs. Discret. Comput. Geom. 54 (4) (2015)
Natan Rubin
On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions. J. ACM 62 (3) (2015)
Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR (2014)
János Pach, Natan Rubin, Gábor Tardos
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. CoRR (2014)
Natan Rubin
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. CoRR (2013)
Natan Rubin
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. FOCS (2013)
Natan Rubin
On Topological Changes in the Delaunay Triangulation of Moving Points. Discret. Comput. Geom. 49 (4) (2013)
Natan Rubin
On topological changes in the Delaunay triangulation of moving points CoRR (2013)
Natan Rubin
On topological changes in the delaunay triangulation of moving points. SCG (2012)
Natan Rubin, Haim Kaplan, Micha Sharir
Improved Bounds for Geometric Permutations. SIAM J. Comput. 41 (2) (2012)
Natan Rubin
Lines Avoiding Balls in Three Dimensions Revisited. Discret. Comput. Geom. 48 (1) (2012)
Haim Kaplan, Natan Rubin, Micha Sharir
A kinetic triangulation scheme for moving points in the plane. Comput. Geom. 44 (4) (2011)
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
Kinetic Stable Delaunay Graphs CoRR (2011)
Natan Rubin
Lines avoiding balls in three dimensions revisited. SCG (2010)
Haim Kaplan, Natan Rubin, Micha Sharir
. SIAM J. Comput. 39 (7) (2010)
Natan Rubin, Haim Kaplan, Micha Sharir
Improved Bounds for Geometric Permutations CoRR (2010)
Natan Rubin, Haim Kaplan, Micha Sharir
Improved Bounds for Geometric Permutations. FOCS (2010)
Haim Kaplan, Natan Rubin, Micha Sharir
A kinetic triangulation scheme for moving points in the plane. SCG (2010)
Haim Kaplan, Natan Rubin, Micha Sharir
A Kinetic Triangulation Scheme for Moving Points in The Plane CoRR (2010)
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
Kinetic stable Delaunay graphs. SCG (2010)
Haim Kaplan, Natan Rubin, Micha Sharir
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica 55 (2) (2009)
Haim Kaplan, Natan Rubin, Micha Sharir
. SODA (2009)
Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38 (3) (2008)
Haim Kaplan, Natan Rubin, Micha Sharir
CoRR (2008)
Haim Kaplan, Natan Rubin, Micha Sharir
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA (2007)
Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
Counting colors in boxes. SODA (2007)