Boris Aronov is a computer scientist, currently a professor at the Polytechnic Institute of New York University. His main area of research isâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Oswin Aichholzer, Martin Balko, +5 authors Birgit Vogtenhuber
- Symposium on Computational Geometry
- 2017

Let P be a finite set of points in the plane in general position, that is, no three points of P are on a common line. We say thatâ€¦Â (More)

Is this relevant?

2014

2014

- Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir
- SIAM J. Comput.
- 2014

We show that, for any Î³ > 0, the combinatorial complexity of the union of n locally Î³-fat objects of constant complexity in theâ€¦Â (More)

Is this relevant?

2010

2010

- HALFSPACE RANGE COUNTING, Boris Aronov, Micha Sharir
- 2010

We present a simple scheme extending the shallow partitioning data structures of MatouÅ¡ek, which supports efficient approximateâ€¦Â (More)

Is this relevant?

2004

2004

- Boris Aronov, Micha Sharir
- Discrete & Computational Geometry
- 2004

We derive improved bounds on the complexity, i.e., the total number of faces of all dimensions, of many cells in arrangements ofâ€¦Â (More)

Is this relevant?

2003

2003

- Boris Aronovy
- 2003

Boris Aronovy J anos Pa hz Mi ha Sharirx G abor Tardos{ ABSTRACT Improving an old result of Clarkson et al., we show that theâ€¦Â (More)

Is this relevant?

Review

2001

Review

2001

ACKNOWLEDGMENT Special thanks to my advisor, Professor Boris Aronov of Polytechnic University, for providing copious amounts ofâ€¦Â (More)

Is this relevant?