Sunil Arya

Hong Kong University of Science and Technology — Hong Kong

Computer Science · Physical Sciences

25h-index5.2kcitations72works2.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(54), Data Management and Algorithms(27), Advanced Image and Video Retrieval Techniques(16), Robotics and Sensor-Based Localization(12), Complexity and Algorithms in Graphs(11)

Publications72 total

Economical Convex Coverings and Applications
SIAM Journal on Computing·2024· 2 cited
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
arXiv (Cornell University)·2023Open Access
Economical Convex Coverings and Applications
Society for Industrial and Applied Mathematics eBooks·2023Open Access
A Blockchain-Based Framework for Covid-19 Detection Using Stacking Ensemble of Pre-Trained Models
SSRN Electronic Journal·2023Open Access
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
ACM Transactions on Algorithms·2022· 5 citedOpen Access
The Value of Standardized Technology to Connected Cars
GRUR International·2020
Approximate nearest neighbor searching with non-euclidean and weighted distances
Symposium on Discrete Algorithms·2019· 2 cited
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
Society for Industrial and Applied Mathematics eBooks·2019· 5 citedOpen Access
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 1 citedOpen Access
Computational Geometry: Proximity and Location
Routledge eBooks·2018· 21 cited
Near-Optimal $\varepsilon$-Kernel Construction and Related Problems
arXiv (Cornell University)·2017· 2 citedOpen Access
Optimal approximate polytope membership
Symposium on Discrete Algorithms·2017· 9 cited
Near-Optimal epsilon-Kernel Construction and Related Problems
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017· 8 citedOpen Access
Optimal Approximate Polytope Membership
2017· 8 citedOpen Access
On the Combinatorial Complexity of Approximating Polytopes
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2016Open Access
Approximate Geometric MST Range Queries
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2015· 2 citedOpen Access
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
2014· 14 cited
RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric
2013· 48 citedOpen Access
Optimal area-sensitive bounds for polytope approximation
2012· 13 cited
Tight Lower Bounds for Halfspace Range Searching
Discrete & Computational Geometry·2012· 12 citedOpen Access
page 1 of 4Next →

Frequent Co-authors

David M. Mount(37), Guilherme D. da Fonseca(10), Theocharis Malamatos(9), Michiel Smid(4), H. Ramesh(3), Siu-Wing Cheng(3), Nathan S. Netanyahu(2), Ruth Silverman(2), Angela Y. Wu(2), Gautam Das(2), Jeffrey S. Salowe(2), Marcel Smid(2), Onuttom Narayan(2), Ho-Yam Addy Fu(2), Jian Xia(2), DM Mount(1), Vijay Kumar(1), Gregory S.X.E. Jefferis(1), Samuel E. Kemp(1), Ka‐Chun Wong(1)