Boris Aronov

4.3k total citations
194 papers, 2.3k citations indexed

About

Boris Aronov is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Computational Theory and Mathematics. According to data from OpenAlex, Boris Aronov has authored 194 papers receiving a total of 2.3k indexed citations (citations by other indexed papers that have themselves been cited), including 138 papers in Computer Graphics and Computer-Aided Design, 58 papers in Computer Vision and Pattern Recognition and 46 papers in Computational Theory and Mathematics. Recurrent topics in Boris Aronov's work include Computational Geometry and Mesh Generation (138 papers), Digital Image Processing Techniques (43 papers) and Data Management and Algorithms (32 papers). Boris Aronov is often cited by papers focused on Computational Geometry and Mesh Generation (138 papers), Digital Image Processing Techniques (43 papers) and Data Management and Algorithms (32 papers). Boris Aronov collaborates with scholars based in United States, Israel and Netherlands. Boris Aronov's co-authors include Micha Sharir, Pankaj K. Agarwal, Sariel Har-Peled, M. Sharir, Franz Aurenhammer, David A. Brown, Friedrich Hoffmann, Joseph O’Rourke, Subhash Suri and Esther Ezra and has published in prestigious journals such as SHILAP Revista de lepidopterología, The Journal of the Acoustical Society of America and The International Journal of Robotics Research.

In The Last Decade

Boris Aronov

181 papers receiving 2.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Boris Aronov United States	28	1.5k	847	530	408	363	194	2.3k
Günter Rote Germany	23	808 0.5×	544 0.6×	499 0.9×	337 0.8×	216 0.6×	152	1.8k
Otfried Schwarzkopf Netherlands	17	869 0.6×	584 0.7×	288 0.5×	509 1.2×	213 0.6×	42	1.8k
Jeff Erickson United States	26	987 0.6×	543 0.6×	621 1.2×	600 1.5×	377 1.0×	116	2.1k
Kai Hormann Switzerland	27	1.3k 0.9×	659 0.8×	226 0.4×	115 0.3×	2.0k 5.6×	102	3.0k
Olivier Devillers France	22	1.6k 1.1×	789 0.9×	196 0.4×	296 0.7×	1.1k 2.9×	129	2.3k
Tamal K. Dey United States	36	2.7k 1.7×	1.6k 1.9×	814 1.5×	163 0.4×	2.4k 6.5×	184	4.5k
L. Paul Chew United States	24	1.1k 0.7×	965 1.1×	251 0.5×	362 0.9×	479 1.3×	47	2.9k
Tom Lyche Norway	29	927 0.6×	543 0.6×	398 0.8×	91 0.2×	2.8k 7.6×	93	3.4k
Chanderjit Bajaj United States	13	838 0.5×	463 0.5×	234 0.4×	82 0.2×	1.3k 3.6×	31	2.0k
Gill Barequet Israel	18	806 0.5×	567 0.7×	137 0.3×	118 0.3×	602 1.7×	108	1.4k

Countries citing papers authored by Boris Aronov

Since Specialization

Citations

This map shows the geographic impact of Boris Aronov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Boris Aronov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Boris Aronov more than expected).

Fields of papers citing papers by Boris Aronov

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Boris Aronov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Boris Aronov. The network helps show where Boris Aronov may publish in the future.

Co-authorship network of co-authors of Boris Aronov

This figure shows the co-authorship network connecting the top 25 collaborators of Boris Aronov. A scholar is included among the top collaborators of Boris Aronov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Boris Aronov. Boris Aronov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Aronov, Boris, Esther Ezra, & Micha Sharir. (2020). Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. arXiv (Cornell University). 3 indexed citations

Aronov, Boris, Esther Ezra, & Joshua Zahl. (2019). Constructive Polynomial Partitioning for Algebraic Curves in\n $\\mathbb{R}^3$ with Applications. arXiv (Cornell University). 2 indexed citations

Aronov, Boris, et al.. (2014). Quickly Placing a Point to Maximize Angles. Canadian Conference on Computational Geometry. 1 indexed citations

Aronov, Boris, Anne Driemel, Marc van Kreveld, Maarten Löffler, & Frank Staals. (2013). Segmentation of trajectories on non-monotone criteria. Symposium on Discrete Algorithms. 1897–1911. 7 indexed citations

Aronov, Boris, et al.. (2011). Witness (Delaunay) graphs. Computational Geometry. 44(6-7). 329–344. 9 indexed citations

Aronov, Boris, Franz Aurenhammer, Ferrán Hurtado, et al.. (2009). Small weak epsilon-nets. Computational Geometry. 42(5). 455–462. 3 indexed citations

Aronov, Boris, et al.. (2008). Cutting cycles of rods in space: hardness and approximation. Symposium on Discrete Algorithms. 1241–1248. 4 indexed citations

Aronov, Boris, Mark de Berg, & Chris Gray. (2008). Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Computational Geometry. 41(1-2). 68–76. 6 indexed citations

Aronov, Boris & Sariel Har-Peled. (2005). On approximating the depth and related problems. Symposium on Discrete Algorithms. 886–894. 27 indexed citations

10.

Aronov, Boris, Franz Aurenhammer, Ferrán Hurtado, et al.. (2005). Small weak epsilon nets. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 52–56. 6 indexed citations

11.

Aronov, Boris & Shakhar Smorodinsky. (2005). On geometric permutations induced by lines transversal through a fixed point. Symposium on Discrete Algorithms. 251–256.

12.

Aronov, Boris, et al.. (2005). Cost prediction for ray shooting in octrees. Computational Geometry. 34(3). 159–181. 2 indexed citations

13.

Aronov, Boris & John Iacono. (2004). Detecting duplicates among similar bit vectors.

14.

Aronov, Boris, Alon Efrat, Vladlen Koltun, & Micha Sharir. (2004). On the union of κ-round objects in three and four dimensions. 383–390. 3 indexed citations

15.

Aronov, Boris, et al.. (2003). Discrete and computational geometry : the Goodman-Pollack Festschrift. CERN Document Server (European Organization for Nuclear Research). 73 indexed citations

16.

Agarwal, Pankaj K., Boris Aronov, & Micha Sharir. (2000). Exact and approximation algorithms for minimum-width cylindrical shells. Symposium on Discrete Algorithms. 510–517. 4 indexed citations

17.

Agarwal, Pankaj K., Boris Aronov, Sariel Har-Peled, & Micha Sharir. (1999). Approximation and exact algorithms for minimum-width annuli and shells. 380–389. 26 indexed citations

18.

Agarwal, Pankaj K., Boris Aronov, & Micha Sharir. (1997). Line transversals of balls and smallest enclosing cylinders in three dimensions. Symposium on Discrete Algorithms. 483–492. 8 indexed citations

19.

Har-Peled, Sariel, Timothy M. Chan, Boris Aronov, Dan Halperin, & Jack Snoeyink. (1995). The complexity of a single face of a minkowski sum.. Canadian Conference on Computational Geometry. 91–96. 9 indexed citations

20.

Aronov, Boris, et al.. (1994). On the sum of squares of cell complexities in hyperplane arrangements. Journal of Combinatorial Theory Series A. 65(2). 311–321. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact