Sunil Arya

5.2k total citations · 1 hit paper
47 papers, 3.1k citations indexed

About

Sunil Arya is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Signal Processing. According to data from OpenAlex, Sunil Arya has authored 47 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computer Graphics and Computer-Aided Design, 23 papers in Computer Vision and Pattern Recognition and 18 papers in Signal Processing. Recurrent topics in Sunil Arya's work include Computational Geometry and Mesh Generation (39 papers), Data Management and Algorithms (18 papers) and Advanced Image and Video Retrieval Techniques (12 papers). Sunil Arya is often cited by papers focused on Computational Geometry and Mesh Generation (39 papers), Data Management and Algorithms (18 papers) and Advanced Image and Video Retrieval Techniques (12 papers). Sunil Arya collaborates with scholars based in United States, Hong Kong and Germany. Sunil Arya's co-authors include David M. Mount, Ruth Silverman, Angela Y. Wu, Nathan S. Netanyahu, Theocharis Malamatos, Marcel Smid, Michiel Smid, Jeffrey S. Salowe, Gautam Das and Onuttom Narayan and has published in prestigious journals such as Journal of the ACM, Pattern Recognition Letters and SIAM Journal on Computing.

In The Last Decade

Sunil Arya

45 papers receiving 2.8k citations

Hit Papers

An optimal algorithm for approximate nearest neighbor sea... 1998 2026 2007 2016 1998 500 1000 1.5k

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Sunil Arya United States 18 1.7k 772 737 622 582 47 3.1k
Jorge Stolfi Brazil 22 1.3k 0.8× 519 0.7× 1.4k 1.9× 267 0.4× 263 0.5× 74 3.2k
Godfried T. Toussaint Canada 24 1.3k 0.8× 516 0.7× 1.1k 1.5× 459 0.7× 316 0.5× 139 3.2k
Amnon Shashua Israel 37 3.7k 2.2× 490 0.6× 280 0.4× 1.2k 1.9× 709 1.2× 105 5.4k
Michael Werman Israel 28 3.5k 2.0× 250 0.3× 621 0.8× 478 0.8× 412 0.7× 117 4.6k
D. T. Lee United States 21 886 0.5× 495 0.6× 1.3k 1.7× 252 0.4× 299 0.5× 42 3.1k
L. Paul Chew United States 24 965 0.6× 362 0.5× 1.1k 1.6× 261 0.4× 262 0.5× 47 2.9k
Raimund Seidel United States 32 1.4k 0.8× 781 1.0× 2.2k 3.0× 541 0.9× 445 0.8× 85 4.5k
Robert A. Hummel United States 19 2.1k 1.2× 316 0.4× 200 0.3× 559 0.9× 335 0.6× 56 3.2k
Michael Lindenbaum Israel 27 1.9k 1.1× 201 0.3× 257 0.3× 518 0.8× 411 0.7× 93 3.0k
Longin Jan Latecki United States 43 5.4k 3.2× 418 0.5× 277 0.4× 1.5k 2.3× 638 1.1× 212 7.0k

Countries citing papers authored by Sunil Arya

Since Specialization
Citations

This map shows the geographic impact of Sunil Arya'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 Sunil Arya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sunil Arya more than expected).

Fields of papers citing papers by Sunil Arya

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sunil Arya. 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 Sunil Arya. The network helps show where Sunil Arya may publish in the future.

Co-authorship network of co-authors of Sunil Arya

This figure shows the co-authorship network connecting the top 25 collaborators of Sunil Arya. A scholar is included among the top collaborators of Sunil Arya 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 Sunil Arya. Sunil Arya is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Arya, Sunil, et al.. (2022). Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Transactions on Algorithms. 18(4). 1–29.
2.
Arya, Sunil, et al.. (2017). Optimal approximate polytope membership. Symposium on Discrete Algorithms. 270–288. 1 indexed citations
3.
Arya, Sunil & Timothy M. Chan. (2014). Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 416–425. 5 indexed citations
4.
Arya, Sunil, et al.. (2012). Polytope Approximation and the Mahler Volume. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 29–42. 1 indexed citations
5.
Arya, Sunil, et al.. (2008). Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. Lecture notes in computer science. 5193. 112. 1 indexed citations
6.
Arya, Sunil, Theocharis Malamatos, & David M. Mount. (2007). A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms. 3(2). 17–17. 12 indexed citations
7.
Arya, Sunil, Theocharis Malamatos, & David M. Mount. (2005). Space-Time Tradeoffs for Approximate Spherical Range Counting. Digital Repository at the University of Maryland (University of Maryland College Park). 535–544. 1 indexed citations
8.
Arya, Sunil, et al.. (2003). Expected-Case Complexity of Approximate Nearest Neighbor Searching. SIAM Journal on Computing. 32(3). 793–815. 5 indexed citations
9.
Arya, Sunil & Theocharis Malamatos. (2002). Linear-size approximate voronoi diagrams. Symposium on Discrete Algorithms. 147–155. 21 indexed citations
10.
Arya, Sunil, Theocharis Malamatos, & David M. Mount. (2002). Space-efficient approximate Voronoi diagrams. 6 indexed citations
11.
Arya, Sunil, Theocharis Malamatos, & David M. Mount. (2001). A simple entropy-based algorithm for planar point location. Symposium on Discrete Algorithms. 262–268. 12 indexed citations
12.
Arya, Sunil, Theocharis Malamatos, & David M. Mount. (2001). Entropy-preserving cuttings and space-efficient planar point location. Symposium on Discrete Algorithms. 256–261. 17 indexed citations
13.
Arya, Sunil, et al.. (2000). Expected-case complexity of approximate nearest neighbor searching. Symposium on Discrete Algorithms. 379–388. 6 indexed citations
15.
Arya, Sunil, David M. Mount, & Michiel Smid. (1999). Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry. 13(2). 91–107. 16 indexed citations
16.
Arya, Sunil, et al.. (1998). ANN: library for approximate nearest neighbor searching. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 158 indexed citations
17.
Arya, Sunil, Gautam Das, David M. Mount, Jeffrey S. Salowe, & Michiel Smid. (1995). Euclidean spanners: short, thin, and lanky. Max Planck Institute for Plasma Physics. 489–498. 5 indexed citations
18.
Arya, Sunil, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, & Angela Y. Wu. (1994). An optimal algorithm for approximate nearest neighbor searching. Symposium on Discrete Algorithms. 573–582. 389 indexed citations
19.
Arya, Sunil & David M. Mount. (1993). Approximate nearest neighbor queries in fixed dimensions. Symposium on Discrete Algorithms. 271–280. 222 indexed citations
20.
Arya, Sunil, Daniel DeMenthon, Peter Meer, & Larry S. Davis. (1991). Textural analysis of range images. Pattern Recognition Letters. 12(10). 619–626. 4 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

Rankless by CCL
2026