Boris Aronov

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

Topic mentions per year

Topic mentions per year

2001-2017
0120012017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
We show that, for any γ > 0, the combinatorial complexity of the union of n locally γ-fat objects of constant complexity in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
We present a simple scheme extending the shallow partitioning data structures of Matoušek, which supports efficient approximate… (More)
  • table 1
Is this relevant?
2004
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?