Boris Aronov

About

Boris Aronov is a Professor in the Department of Computer Science and Engineering at NYU Tandon School of Engineering. His research interests include computational algorithms, discrete and combinatorial geometry, and algorithms. Aronov has a distinguished academic background, having earned a Bachelor of Arts in Computer Science and Mathematics from Queens College, City University of New York in 1984, followed by a Master of Science and a Doctor of Philosophy in Computer Science from the Courant Institute, New York University, in 1986 and 1989 respectively. His extensive publication record features numerous contributions to the fields of computational geometry and algorithms, demonstrating his active engagement in advancing theoretical and applied aspects of these disciplines.

Research topics

• Geometry
• Combinatorics
• Mathematics
• Computer Science
• Discrete mathematics
• Mathematical analysis

Selected publications

• On pseudo-disk hypergraphs

  Computational Geometry · 2020 · 9 citations

  1st authorCorresponding
  DOI

• Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems

  Discrete & Computational Geometry · 2022 · 8 citations

  1st authorCorresponding
  PublisherDOI

• Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model

  Computational Geometry · 2022-09-15 · 3 citations

  articleOpen access1st author

  We present subquadratic algorithms in the algebraic decision-tree model for several 3Sum-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane, and a set C of n triangles in the plane, we want to count, for each triangle Δ∈C, the number of intersection points between the segments of A and those of B that lie in Δ. We present solutions in the algebraic decision-tree model whose cost is O(n6…

  PublisherOA PDFDOI

• Eight-Partitioning Points in 3D, and Efficiently Too

  Discrete & Computational Geometry · 2025-06-12 · 1 citations

  articleOpen access1st author

  Abstract An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in $$\mathbb {R}^3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mn>3</mml:mn> </mml:msup> </mml:math> consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in $$\mathbb {R…

  PublisherOA PDFDOI

• Compatible Triangulations of Simple Polygons

  ArXiv.org · 2026-03-01

  articleOpen access

  Let $P$ and $Q$ be simple polygons with $n$ vertices each. We wish to compute triangulations of $P$ and $Q$ that are combinatorially equivalent, if they exist. We consider two versions of the problem: if a triangulation of $P$ is given, we can decide in $O(n\log n + nr)$ time if $Q$ has a compatible triangulation, where $r$ is the number of reflex vertices of $Q$. If we are already given the correspondence between vertices of $P$ and $Q$ (but no triangulation), we can find compatible triangulati…

  PublisherOA PDF

Recent grants

• AF: Small: Exploring Algebraic Methods in Computational and Combinatorial Geometry

  NSF · $348k · 2012–2018

• Understanding Geometric Arrangements: Unions and Beyond

  NSF · $200k · 2008–2012

• BSF:2014170: SINR-Governed Wireless Networks: Geometric Analysis and Algorithms

  NSF · $40k · 2015–2021

Frequent coauthors

• Micha Sharir

  Tel Aviv University

  128 shared

• David A. Brown

  University of Massachusetts Dartmouth

  66 shared

• Marc van Kreveld

  49 shared

• Pankaj K. Agarwal

  42 shared

• Frank Staals

  38 shared

• Maarten Löffler

  38 shared

• Mark de Berg

  University of Minnesota

  28 shared

• Esther Ezra

  28 shared

Similar researchers at New York University

• Rob Fergush-95
• Dennis Shashah-84
• Mehryar Mohrih-77