Boris Aronov

Boris Aronov is a renowned computer scientist and mathematician, best known for his contributions to computational geometry. He has made significant advances in the fields of algorithms, data structures, and geometric complexity. His work often involves the intersection of geometry and algorithms, with applications in areas such as motion planning, visibility, and geometric data structures. Aronov has published extensively in top-tier journals and conferences, including *Discrete and Computational Geometry*, *Computational Geometry: Theory and Applications*, and *Combinatorica*. He has also contributed to the theory of geometric permutations, incidences, and arrangements of curves and surfaces. His research has had a lasting impact on both theoretical and applied computer science.

Boris Aronov is a Professor of Computer Science at the Tandon School of Engineering, New York University, specializing in Computational Geometry, Combinatorial Geometry, Discrete Geometry, and Algorithms. His research focuses on geometric algorithms, computational complexity, and geometric data structures. He has contributed to various areas, including proximity problems, visibility, and motion planning for multiple robots. His work often involves the analysis of geometric properties and their algorithmic implications, with applications in computational geometry and discrete mathematics. Aronov's research includes the study of Minkowski-type theorems, ε-nets, and geodesic Voronoi diagrams, highlighting his expertise in geometric optimization and computational methods.