Boris Aronov

Boris Aronov is a Professor in the Department of Computer Science and Engineering at NYU Tandon School of Engineering, specializing in computational and combinatorial geometry. His research develops algorithms for fundamental geometric problems including point partitioning, spatial data structures, graph separators, and distance computation.

Key research themes include:

• Efficient algorithms for high-dimensional geometric problems
• Dynamic data structures for proximity queries
• Combinatorial solutions to spatial voting and pattern matching
• Algebraic-geometric methods for curve and surface analysis

Dr. Aronov has authored over 100 peer-reviewed publications in top computational geometry venues such as Symposium on Computational Geometry (SoCG) and Symposium on Discrete Algorithms (SODA).