Faculty Profiles - ARYA Sunil | The Hong Kong University of Science and Technology

Sunil ARYA
安雅信

PhD in Computer Science
The University of Maryland, 1995

Associate Professor
Department of Computer Science and Engineering

(852) 2358 8769
arya@ust.hk
Room 3514
Personal Web

Google Scholar

Azu2w_MAAAAJ

ORCID

0000-0003-0939-4192

ResearcherID

C-9012-2011

Scopus ID

35199427600

Research Interest Publications Projects Teaching Assignment Space used

Research Interest

Computational geometry and topology
Data structures
Algorithms

Publications

All Years 64 2024 0 2023 2 2022 1 2021 0 2020 1 2019 1 2018 59

2023 2

Economical convex coverings and applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, v. 2023-January, January 2023, p. 1834-1861
Arya, Sunil; D. da Fonseca, Guilherme; Mount, David M.
Conference paper

Optimal volume-sensitive bounds for polytope approximation

Leibniz International Proceedings in Informatics, LIPIcs, v. 258, June 2023, article number 9
Arya, Sunil; Mount, David M.
Conference paper

2022 1

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

ACM Transactions on Algorithms, v. 18, (4), October 2022, article number 35, p. 1-29
Arya, Rahul; Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David
Article

2020 1

Optimal bound on the combinatorial complexity of approximating polytopes

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms / Edited by Shuchi Chawla. Philadelphia, USA : Society for Industrial and Applied Mathematics, 2020, p. 786-805
Arya, Rahul; Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M
Conference paper

2019 1

Approximate Nearest Neighbor Searching With Non-Euclidean and Weighted Distances

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, p. 355-372
Abdelkader, A; Arya, Sunil; Fonseca, Guilherme D. da; Mount, David M
Conference paper

2018 2

Approximate Polytope Membership Queries

SIAM Journal on Computing, v. 47, (1), 2018, p. 1-51
Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M.
Article

Approximate convex intersection detection with applications to width and Minkowski sums

Leibniz International Proceedings in Informatics, LIPIcs, v. 112, August 2018
Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M.
Conference paper

2017 4

On the Combinatorial Complexity of Approximating Polytopes

Discrete and Computational Geometry, v. 58, (4), December 2017, p. 849-870
Arya, Sunil; Da fonseca, Guilherme D.; Mount, David M.
Article

Near-optimal epsilon-kernel construction and related problems

Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.
Conference paper

Near-optimal ϵ-kernel Construction and Related Problems

Leibniz International Proceedings in Informatics, LIPIcs, v. 77, June 2017, p. 1-15
Arya, Sunil; Da fonseca, Guilherme Dias; Mount, David M.
Conference paper

Optimal Approximate Polytope Membership

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, p. 270-288
Arya, Sunil; Fonseca, Guilherme D. da; Mount, David M.
Conference paper

2016 2

A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees

Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), v. 2, 2016, p. 1220-1233
Arya, Sunil; Mount, David M.
Conference paper

On the Combinatorial Complexity of Approximating Polytopes

Leibniz International Proceedings in Informatics, LIPIcs, v. 51, June 2016, p. 11.1-11.15
Arya, Sunil; Fonseca, D. da Guilherme; Mount, David M.
Conference paper

2015 1

Approximate geometric MST range queries

Leibniz International Proceedings in Informatics, LIPIcs, v. 34, June 2015, p. 781-795
Arya, Sunil; Mount, David M.; Park, Eunhui
Conference paper

2014 1

Better ε-dependencies for offline approximate nearest neighbor search, euclidean minimum spanning trees, and ε-kernels

Proceedings of the thirtieth annual symposium on Computational geometry, New York, NY, USA : ACM, 2014, p. 416-425
Arya, Sunil; Chan, Timothy M.
Conference paper

2012 3

Polytope Approximation and the Mahler Volume

Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, 2012, p. 29-42
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.
Article

Tight Lower Bounds for Halfspace Range Searching

Discrete & Computational Geometry, v. 47, (4), 2012, Jun, p. 711-730
Arya, Sunil; Mount, David M.; Xia, Jian
Article

Optimal area-sensitive bounds for polytope approximation

Proceeding: SoCG '12 Proceedings of the twenty-eighth annual symposium on Computational geometry, New York, NY, USA : ACM, 2012, p. 363-372
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.
Conference paper

2011 1

Approximate Polytope Membership Queries

STOC '11, Proceedings of the 43rd annual ACM Symposium on Theory of Computing, v. 2011, Jun, p. 579-586
Arya, Sunil; Da fonseca, G.D.; Mount, D.M.
Article

2010 3

A unified approach to approximate proximity searching

18th Annual European Symposium on Algorithms (ESA), v. 3, 2010, p. 374-385
Arya, Sunil; Fonseca, Guilherme; Mount, David
Conference paper

A unified approach to approximate proximity searching

Algorithms - ESA 2010: 18th Annual European Symposium, Proceedings, v. 1, 2010, Part of the Lecture Notes in Computer Science book series (LNCS, volume 6346)
Arya, S.; Da Fonseca, G.d.; Mount, D.m.
Conference paper

Tight lower bounds for halfspace range searching

Proceedings of the Annual Symposium on Computational Geometry, 2010, p. 29-37
Arya, S.; Mount, D.M.; Xia, J.
Conference paper

2009 2

Space-Time Tradeoffs for Approximate Nearest Neighbor Searching

JOURNAL OF THE ACM, v. 57, (1), 2009, Nov, Article number 1
Arya, Sunil; Malamatos, Theocharis; Mount, David M.
Article

The Effect of Corners on the Complexity of Approximate Range Searching

Discrete & Computational Geometry, v. 41, (3), 2009, APR, p. 398-443
Arya, Sunil; Malamatos, Theocharis; Mount, David M.
Article

2008 2

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces

Lecture Notes in Computer Science, v. 5193, 2008, p. 112-123
Arya, Sunil; Mount, David M.; Vigneron, Antoine; Xia, Jian
Conference paper

Tradeoffs in approximate range searching made simpler

Proceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008, 2008, p. 237-244
Arya, Sunil; Da Fonseca, G.D.; Mount, D.M.
Conference paper

2007 2

A simple entropy-based algorithm for planar point location

ACM Transactions on Algorithms, v. 3, (2), 2007
Arya, Sunil; Malamatos, T.; Mount, D.M.
Article

Optimal Expected-case Planar Point Location

SIAM journal on computing, v. 37, (2), 2007, p. 584-610
Arya, Sunil; Malamatos, Theocharis; Mount, David M.; Wong, Ka Chun
Article

2006 2

On the importance of idempotence

Proceedings of the Annual ACM Symposium on Theory of Computing, v. 2006, 2006, p. 564-573
Arya, Sunil; Malamatos, Theocharis; Mount, D.M.
Conference paper

The effect of corners on the complexity of approximate range searching

Proceedings of the Annual Symposium on Computational Geometry, v. 2006, 2006, p. 11-20
Arya, S.; Malamatos, T.; Mount, D.M.
Conference paper

2005 3

Inhibitory effect of extracts of latex of Calotropis procera against Candida albicans: A preliminary study

Indian journal of pharmacology, v. 37, Issue 5, 2005, p. 334-335
Sehgal, R.; Arya, Sunil; Kumar, VL
Article

Computational Geometry: Proximity and Location

Handbook of data structures and applications / Edited by Dinesh P. Mehta, Sartaj Sahni. Boca Raton, Florida : Chapman and Hall/CRC, 2004, Chapter 63
Arya, Sunil; Mount, David
Book chapter

Space-time tradeoffs for approximate spherical range counting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, p. 535-544
Arya, Sunil; Malamatos, Theocharis; Mount, D.M.
Conference paper

2003 1

Expected-case Complexity of Approximate Nearest Neighbor Searching

SIAM journal on computing, v. 32, (3), 2003, p. 793-815
Arya, Sunil; Fu, HYA
Article

2002 3

Binary space partitions for axis-parallel line segments: Size-height tradeoffs

Information Processing Letters, v. 84, (4), 2002, NOV 30, p. 201-206
Arya, Sunil
Article

Linear-size approximate Voronoi diagrams

PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, p. 147-155
Arya, Sunil; Malamatos, T.
Conference paper

Space-efficient approximate Voronoi diagrams

Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 2002, p. 721-730
Arya, Sunil; Malamatos, T.; Mount, D.M.
Conference paper

2001 3

Approximation algorithm for multiple-tool milling

International journal of computational geometry & applications, v. 11, (3), 2001, JUN, p. 339-372
Arya, Sunil; Cheng, SW; Mount, DM
Article

A simple entropy-based algorithm for planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, p. 262-268
Arya, S.; Malamatos, T.; Mount, D.M.
Conference paper

Entropy-preserving cuttings and space-efficient planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, p. 256-261
Arya, Sunil; Malamatos, T.; Mount, D.M.
Conference paper

2000 5

Approximate range searching

Computational Geometry: Theory and Applications, v. 17, (3-4), December 2000, p. 135-152
Arya, Sunil; Mount, David M.
Article

Efficient Expected-Case Algorithms for Planar Point Location

Lecture Notes in Computer Science, v. 1851, 2000, p. 353-366
Arya, Sunil; Cheng, Siu-Wing; Mount, David M.; Ramesh, H.
Article

Hardness of Set Cover with Intersection 1

Lecture Notes in Computer Science, v. 1853, 2000, p. 624-635
Anil Kumar, V. S.; Arya, Sunil; Ramesh, Honnasiddaiah S.
Article

Expected-case complexity of approximate nearest neighbor searching

PROC ANNU ACM SIAM SYMP DISCRETE ALGORITHMS, 2000, p. 379-388
Arya, Sunil; Fu, Ho-Yam Addy
Conference paper

Nearly Optimal Expected-Case Planar Point Location

Annual Symposium on Foundations of Computer Science - Proceedings, 2000, p. 208-218
Arya, Sunil; Malamatos, Theocharis; Mount, David M.
Conference paper

1999 2

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 13, (2), 1999, JUN, p. 91-107
Arya, Sunil; Mount, DM; Smid, M.
Article

On the expected depth of random circuits

COMBINATORICS Probability & COMPUTING, v. 8, (3), 1999, MAY, p. 209-227
Arya, Sunil; Golin, Mordecai Jay; Mehlhorn, Kurt
Article

1998 4

A 2.5-factor approximation algorithm for the k-MST problem

Information Processing Letters, v. 65, (3), 1998, FEB 13, p. 117-118
Arya, Sunil; Ramesh, H.
Article

An optimal algorithm for approximate nearest neighbor searching in fixed dimensions

JOURNAL OF THE ACM, v. 45, (6), 1998, NOV, p. 891-923
Arya, Sunil; Mount, DM; Netanyahu, NS; Silverman, R.; Wu, AY
Article

ANN: library for approximate nearest neighbor searching

Proceedings of IEEE CGC Workshop on Computational Geometry, Providence, RI, 1998, p. 33-40
Arya, Sunil; Mount, DM
Article

Approximation algorithms for multiple-tool miling

Proceedings of the fourteenth annual symposium on Computational geometry, 07-10 June 1998, p. 297-306
Arya, Sunil; Cheng, Siu Wing; Mount, David M.
Conference paper

1997 1

Efficient Construction of a Bounded Degree Spanner with Low Weight

Algorithmica, v. 17, 1997, p. 33-54
Arya, Sunil; Smid, M.
Article

1996 2

Accounting for Boundary Effects in Nearest-Neighbor Searching

Discrete & Computational Geometry, v. 16, (2), 1996, SEP, p. 155-176
Arya, Sunil; Mount, DM; Narayan, O.
Article

Nearest neighbor searching and applications

University of Maryland at College Park, 3 Oct 1996
Arya, Sunil
Conference paper

1995 3

Accounting for boundary effects in nearest neighbor searching

Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG), 1995, p. 336–344
Arya, Sunil; Mount, D.M.; Narayan, O.
Conference paper

Approximate range searching

Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG), 1995, p. 172–181
Arya, Sunil; Mount, D.M.
Conference paper

Euclidean spanners: short, thin and lanky

Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC), 1995, p. 489–498
Arya, Sunil; Das, G.; Mount, D.M.; Salowe, J.S.; Smid, M.
Conference paper

1994 3

An optimal algorithm for approximate nearest neighbor searching

Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994, p. 573–582
Arya, Sunil; Mount, D.M.; Netanyahu, N.S.; Silverman, R.; Wu, A.
Conference paper

Efficient construction of a bounded degree spanner with low weight

Proceedings of the 2nd Annual European Symposium on Algorithms (ESA), v. 855, Lecture Notes in Computer Science, Springer-Verlag, 1994, p. 48–59
Arya, Sunil; Smid, M.
Conference paper

Randomized and deterministic algorithms for geometric spanners of small diameter

Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS), 1994, p. 703–712
Arya, Sunil; Mount, D.M.; Smid, M.
Conference paper

1993 2

Algorithms for Fast Vector Quantization

Proceedings of the IEEE Data Compression Conference (DCC), Edited by J. A. Storer and M. Cohn. IEEE Press, 1993, p. 381–390
Arya, Sunil; Mount, D.M.
Conference paper

Approximate Nearest Neighbor Queries in Fixed Dimensions

Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993, p. 271–280
Arya, Sunil; Mount, D.M.
Conference paper

1991 1

Textural Analysis of Range Images

Pattern Recognition Letters, v. 12, 1991, p. 619–626
Arya, Sunil; DeMenthon, D.; Meer, P.; Davis, L.S.
Article

1982 1

Optimal scheduling of assembly language kernels for vector processors

Annual Allerton Conference on Communication, Control, and Computing, 19 th, Monticello, IL, 1982, p. 486-493
Arya, Sunil; Calahan, Da
Conference paper

Conference paper 2

Economical convex coverings and applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, v. 2023-January, January 2023, p. 1834-1861
Arya, Sunil; D. da Fonseca, Guilherme; Mount, David M.

Optimal volume-sensitive bounds for polytope approximation

Leibniz International Proceedings in Informatics, LIPIcs, v. 258, June 2023, article number 9
Arya, Sunil; Mount, David M.

Article 1

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

ACM Transactions on Algorithms, v. 18, (4), October 2022, article number 35, p. 1-29
Arya, Rahul; Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David

Conference paper 1

Optimal bound on the combinatorial complexity of approximating polytopes

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms / Edited by Shuchi Chawla. Philadelphia, USA : Society for Industrial and Applied Mathematics, 2020, p. 786-805
Arya, Rahul; Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M

Conference paper 1

Approximate Nearest Neighbor Searching With Non-Euclidean and Weighted Distances

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, p. 355-372
Abdelkader, A; Arya, Sunil; Fonseca, Guilherme D. da; Mount, David M

Article 1

Approximate Polytope Membership Queries

SIAM Journal on Computing, v. 47, (1), 2018, p. 1-51
Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M.

Conference paper 1

Approximate convex intersection detection with applications to width and Minkowski sums

Leibniz International Proceedings in Informatics, LIPIcs, v. 112, August 2018
Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M.

Article 1

On the Combinatorial Complexity of Approximating Polytopes

Discrete and Computational Geometry, v. 58, (4), December 2017, p. 849-870
Arya, Sunil; Da fonseca, Guilherme D.; Mount, David M.

Conference paper 3

Near-optimal epsilon-kernel construction and related problems

Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.

Near-optimal ϵ-kernel Construction and Related Problems

Leibniz International Proceedings in Informatics, LIPIcs, v. 77, June 2017, p. 1-15
Arya, Sunil; Da fonseca, Guilherme Dias; Mount, David M.

Optimal Approximate Polytope Membership

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, p. 270-288
Arya, Sunil; Fonseca, Guilherme D. da; Mount, David M.

Conference paper 2

A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees

Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), v. 2, 2016, p. 1220-1233
Arya, Sunil; Mount, David M.

On the Combinatorial Complexity of Approximating Polytopes

Leibniz International Proceedings in Informatics, LIPIcs, v. 51, June 2016, p. 11.1-11.15
Arya, Sunil; Fonseca, D. da Guilherme; Mount, David M.

Conference paper 1

Approximate geometric MST range queries

Leibniz International Proceedings in Informatics, LIPIcs, v. 34, June 2015, p. 781-795
Arya, Sunil; Mount, David M.; Park, Eunhui

Conference paper 1

Better ε-dependencies for offline approximate nearest neighbor search, euclidean minimum spanning trees, and ε-kernels

Proceedings of the thirtieth annual symposium on Computational geometry, New York, NY, USA : ACM, 2014, p. 416-425
Arya, Sunil; Chan, Timothy M.

Article 2

Polytope Approximation and the Mahler Volume

Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, 2012, p. 29-42
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.

Tight Lower Bounds for Halfspace Range Searching

Discrete & Computational Geometry, v. 47, (4), 2012, Jun, p. 711-730
Arya, Sunil; Mount, David M.; Xia, Jian

Conference paper 1

Optimal area-sensitive bounds for polytope approximation

Proceeding: SoCG '12 Proceedings of the twenty-eighth annual symposium on Computational geometry, New York, NY, USA : ACM, 2012, p. 363-372
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.

Article 1

Approximate Polytope Membership Queries

STOC '11, Proceedings of the 43rd annual ACM Symposium on Theory of Computing, v. 2011, Jun, p. 579-586
Arya, Sunil; Da fonseca, G.D.; Mount, D.M.

Conference paper 3

A unified approach to approximate proximity searching

18th Annual European Symposium on Algorithms (ESA), v. 3, 2010, p. 374-385
Arya, Sunil; Fonseca, Guilherme; Mount, David

A unified approach to approximate proximity searching

Algorithms - ESA 2010: 18th Annual European Symposium, Proceedings, v. 1, 2010, Part of the Lecture Notes in Computer Science book series (LNCS, volume 6346)
Arya, S.; Da Fonseca, G.d.; Mount, D.m.

Tight lower bounds for halfspace range searching

Proceedings of the Annual Symposium on Computational Geometry, 2010, p. 29-37
Arya, S.; Mount, D.M.; Xia, J.

Article 2

Space-Time Tradeoffs for Approximate Nearest Neighbor Searching

JOURNAL OF THE ACM, v. 57, (1), 2009, Nov, Article number 1
Arya, Sunil; Malamatos, Theocharis; Mount, David M.

The Effect of Corners on the Complexity of Approximate Range Searching

Discrete & Computational Geometry, v. 41, (3), 2009, APR, p. 398-443
Arya, Sunil; Malamatos, Theocharis; Mount, David M.

Conference paper 2

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces

Lecture Notes in Computer Science, v. 5193, 2008, p. 112-123
Arya, Sunil; Mount, David M.; Vigneron, Antoine; Xia, Jian

Tradeoffs in approximate range searching made simpler

Proceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008, 2008, p. 237-244
Arya, Sunil; Da Fonseca, G.D.; Mount, D.M.

Article 2

A simple entropy-based algorithm for planar point location

ACM Transactions on Algorithms, v. 3, (2), 2007
Arya, Sunil; Malamatos, T.; Mount, D.M.

Optimal Expected-case Planar Point Location

SIAM journal on computing, v. 37, (2), 2007, p. 584-610
Arya, Sunil; Malamatos, Theocharis; Mount, David M.; Wong, Ka Chun

Conference paper 2

On the importance of idempotence

Proceedings of the Annual ACM Symposium on Theory of Computing, v. 2006, 2006, p. 564-573
Arya, Sunil; Malamatos, Theocharis; Mount, D.M.

The effect of corners on the complexity of approximate range searching

Proceedings of the Annual Symposium on Computational Geometry, v. 2006, 2006, p. 11-20
Arya, S.; Malamatos, T.; Mount, D.M.

Article 1

Inhibitory effect of extracts of latex of Calotropis procera against Candida albicans: A preliminary study

Indian journal of pharmacology, v. 37, Issue 5, 2005, p. 334-335
Sehgal, R.; Arya, Sunil; Kumar, VL

Book chapter 1

Computational Geometry: Proximity and Location

Handbook of data structures and applications / Edited by Dinesh P. Mehta, Sartaj Sahni. Boca Raton, Florida : Chapman and Hall/CRC, 2004, Chapter 63
Arya, Sunil; Mount, David

Conference paper 1

Space-time tradeoffs for approximate spherical range counting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, p. 535-544
Arya, Sunil; Malamatos, Theocharis; Mount, D.M.

Article 1

Expected-case Complexity of Approximate Nearest Neighbor Searching

SIAM journal on computing, v. 32, (3), 2003, p. 793-815
Arya, Sunil; Fu, HYA

Article 1

Binary space partitions for axis-parallel line segments: Size-height tradeoffs

Information Processing Letters, v. 84, (4), 2002, NOV 30, p. 201-206
Arya, Sunil

Conference paper 2

Linear-size approximate Voronoi diagrams

PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, p. 147-155
Arya, Sunil; Malamatos, T.

Space-efficient approximate Voronoi diagrams

Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 2002, p. 721-730
Arya, Sunil; Malamatos, T.; Mount, D.M.

Article 1

Approximation algorithm for multiple-tool milling

International journal of computational geometry & applications, v. 11, (3), 2001, JUN, p. 339-372
Arya, Sunil; Cheng, SW; Mount, DM

Conference paper 2

A simple entropy-based algorithm for planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, p. 262-268
Arya, S.; Malamatos, T.; Mount, D.M.

Entropy-preserving cuttings and space-efficient planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, p. 256-261
Arya, Sunil; Malamatos, T.; Mount, D.M.

Article 3

Approximate range searching

Computational Geometry: Theory and Applications, v. 17, (3-4), December 2000, p. 135-152
Arya, Sunil; Mount, David M.

Efficient Expected-Case Algorithms for Planar Point Location

Lecture Notes in Computer Science, v. 1851, 2000, p. 353-366
Arya, Sunil; Cheng, Siu-Wing; Mount, David M.; Ramesh, H.

Hardness of Set Cover with Intersection 1

Lecture Notes in Computer Science, v. 1853, 2000, p. 624-635
Anil Kumar, V. S.; Arya, Sunil; Ramesh, Honnasiddaiah S.

Conference paper 2

Expected-case complexity of approximate nearest neighbor searching

PROC ANNU ACM SIAM SYMP DISCRETE ALGORITHMS, 2000, p. 379-388
Arya, Sunil; Fu, Ho-Yam Addy

Nearly Optimal Expected-Case Planar Point Location

Annual Symposium on Foundations of Computer Science - Proceedings, 2000, p. 208-218
Arya, Sunil; Malamatos, Theocharis; Mount, David M.

Article 2

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 13, (2), 1999, JUN, p. 91-107
Arya, Sunil; Mount, DM; Smid, M.

On the expected depth of random circuits

COMBINATORICS Probability & COMPUTING, v. 8, (3), 1999, MAY, p. 209-227
Arya, Sunil; Golin, Mordecai Jay; Mehlhorn, Kurt

Article 3

A 2.5-factor approximation algorithm for the k-MST problem

Information Processing Letters, v. 65, (3), 1998, FEB 13, p. 117-118
Arya, Sunil; Ramesh, H.

An optimal algorithm for approximate nearest neighbor searching in fixed dimensions

JOURNAL OF THE ACM, v. 45, (6), 1998, NOV, p. 891-923
Arya, Sunil; Mount, DM; Netanyahu, NS; Silverman, R.; Wu, AY

ANN: library for approximate nearest neighbor searching

Proceedings of IEEE CGC Workshop on Computational Geometry, Providence, RI, 1998, p. 33-40
Arya, Sunil; Mount, DM

Conference paper 1

Approximation algorithms for multiple-tool miling

Proceedings of the fourteenth annual symposium on Computational geometry, 07-10 June 1998, p. 297-306
Arya, Sunil; Cheng, Siu Wing; Mount, David M.

Article 1

Efficient Construction of a Bounded Degree Spanner with Low Weight

Algorithmica, v. 17, 1997, p. 33-54
Arya, Sunil; Smid, M.

Article 1

Accounting for Boundary Effects in Nearest-Neighbor Searching

Discrete & Computational Geometry, v. 16, (2), 1996, SEP, p. 155-176
Arya, Sunil; Mount, DM; Narayan, O.

Conference paper 1

Nearest neighbor searching and applications

University of Maryland at College Park, 3 Oct 1996
Arya, Sunil

Conference paper 3

Accounting for boundary effects in nearest neighbor searching

Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG), 1995, p. 336–344
Arya, Sunil; Mount, D.M.; Narayan, O.

Approximate range searching

Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG), 1995, p. 172–181
Arya, Sunil; Mount, D.M.

Euclidean spanners: short, thin and lanky

Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC), 1995, p. 489–498
Arya, Sunil; Das, G.; Mount, D.M.; Salowe, J.S.; Smid, M.

Conference paper 3

An optimal algorithm for approximate nearest neighbor searching

Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994, p. 573–582
Arya, Sunil; Mount, D.M.; Netanyahu, N.S.; Silverman, R.; Wu, A.

Efficient construction of a bounded degree spanner with low weight

Proceedings of the 2nd Annual European Symposium on Algorithms (ESA), v. 855, Lecture Notes in Computer Science, Springer-Verlag, 1994, p. 48–59
Arya, Sunil; Smid, M.

Randomized and deterministic algorithms for geometric spanners of small diameter

Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS), 1994, p. 703–712
Arya, Sunil; Mount, D.M.; Smid, M.

Conference paper 2

Algorithms for Fast Vector Quantization

Proceedings of the IEEE Data Compression Conference (DCC), Edited by J. A. Storer and M. Cohn. IEEE Press, 1993, p. 381–390
Arya, Sunil; Mount, D.M.

Approximate Nearest Neighbor Queries in Fixed Dimensions

Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993, p. 271–280
Arya, Sunil; Mount, D.M.

Article 1

Textural Analysis of Range Images

Pattern Recognition Letters, v. 12, 1991, p. 619–626
Arya, Sunil; DeMenthon, D.; Meer, P.; Davis, L.S.

Conference paper 1

Optimal scheduling of assembly language kernels for vector processors

Annual Allerton Conference on Communication, Control, and Computing, 19 th, Monticello, IL, 1982, p. 486-493
Arya, Sunil; Calahan, Da

2018 2

Approximate Polytope Membership Queries

SIAM Journal on Computing, v. 47, (1), 2018, p. 1-51
Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M.
Article

Approximate convex intersection detection with applications to width and Minkowski sums

Leibniz International Proceedings in Informatics, LIPIcs, v. 112, August 2018
Arya, Sunil; Da Fonseca, Guilherme Dias; Mount, David M.
Conference paper

2017 4

On the Combinatorial Complexity of Approximating Polytopes

Discrete and Computational Geometry, v. 58, (4), December 2017, p. 849-870
Arya, Sunil; Da fonseca, Guilherme D.; Mount, David M.
Article

Near-optimal epsilon-kernel construction and related problems

Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.
Conference paper

Near-optimal ϵ-kernel Construction and Related Problems

Leibniz International Proceedings in Informatics, LIPIcs, v. 77, June 2017, p. 1-15
Arya, Sunil; Da fonseca, Guilherme Dias; Mount, David M.
Conference paper

Optimal Approximate Polytope Membership

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, p. 270-288
Arya, Sunil; Fonseca, Guilherme D. da; Mount, David M.
Conference paper

2016 2

A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees

Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), v. 2, 2016, p. 1220-1233
Arya, Sunil; Mount, David M.
Conference paper

On the Combinatorial Complexity of Approximating Polytopes

Leibniz International Proceedings in Informatics, LIPIcs, v. 51, June 2016, p. 11.1-11.15
Arya, Sunil; Fonseca, D. da Guilherme; Mount, David M.
Conference paper

2015 1

Approximate geometric MST range queries

Leibniz International Proceedings in Informatics, LIPIcs, v. 34, June 2015, p. 781-795
Arya, Sunil; Mount, David M.; Park, Eunhui
Conference paper

2014 1

Better ε-dependencies for offline approximate nearest neighbor search, euclidean minimum spanning trees, and ε-kernels

Proceedings of the thirtieth annual symposium on Computational geometry, New York, NY, USA : ACM, 2014, p. 416-425
Arya, Sunil; Chan, Timothy M.
Conference paper

2012 3

Polytope Approximation and the Mahler Volume

Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, 2012, p. 29-42
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.
Article

Tight Lower Bounds for Halfspace Range Searching

Discrete & Computational Geometry, v. 47, (4), 2012, Jun, p. 711-730
Arya, Sunil; Mount, David M.; Xia, Jian
Article

Optimal area-sensitive bounds for polytope approximation

Proceeding: SoCG '12 Proceedings of the twenty-eighth annual symposium on Computational geometry, New York, NY, USA : ACM, 2012, p. 363-372
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M.
Conference paper

2011 1

Approximate Polytope Membership Queries

STOC '11, Proceedings of the 43rd annual ACM Symposium on Theory of Computing, v. 2011, Jun, p. 579-586
Arya, Sunil; Da fonseca, G.D.; Mount, D.M.
Article

2010 3

A unified approach to approximate proximity searching

18th Annual European Symposium on Algorithms (ESA), v. 3, 2010, p. 374-385
Arya, Sunil; Fonseca, Guilherme; Mount, David
Conference paper

A unified approach to approximate proximity searching

Algorithms - ESA 2010: 18th Annual European Symposium, Proceedings, v. 1, 2010, Part of the Lecture Notes in Computer Science book series (LNCS, volume 6346)
Arya, S.; Da Fonseca, G.d.; Mount, D.m.
Conference paper

Tight lower bounds for halfspace range searching

Proceedings of the Annual Symposium on Computational Geometry, 2010, p. 29-37
Arya, S.; Mount, D.M.; Xia, J.
Conference paper

2009 2

Space-Time Tradeoffs for Approximate Nearest Neighbor Searching

JOURNAL OF THE ACM, v. 57, (1), 2009, Nov, Article number 1
Arya, Sunil; Malamatos, Theocharis; Mount, David M.
Article

The Effect of Corners on the Complexity of Approximate Range Searching

Discrete & Computational Geometry, v. 41, (3), 2009, APR, p. 398-443
Arya, Sunil; Malamatos, Theocharis; Mount, David M.
Article

2008 2

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces

Lecture Notes in Computer Science, v. 5193, 2008, p. 112-123
Arya, Sunil; Mount, David M.; Vigneron, Antoine; Xia, Jian
Conference paper

Tradeoffs in approximate range searching made simpler

Proceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008, 2008, p. 237-244
Arya, Sunil; Da Fonseca, G.D.; Mount, D.M.
Conference paper

2007 2

A simple entropy-based algorithm for planar point location

ACM Transactions on Algorithms, v. 3, (2), 2007
Arya, Sunil; Malamatos, T.; Mount, D.M.
Article

Optimal Expected-case Planar Point Location

SIAM journal on computing, v. 37, (2), 2007, p. 584-610
Arya, Sunil; Malamatos, Theocharis; Mount, David M.; Wong, Ka Chun
Article

2006 2

On the importance of idempotence

Proceedings of the Annual ACM Symposium on Theory of Computing, v. 2006, 2006, p. 564-573
Arya, Sunil; Malamatos, Theocharis; Mount, D.M.
Conference paper

The effect of corners on the complexity of approximate range searching

Proceedings of the Annual Symposium on Computational Geometry, v. 2006, 2006, p. 11-20
Arya, S.; Malamatos, T.; Mount, D.M.
Conference paper

2005 3

Inhibitory effect of extracts of latex of Calotropis procera against Candida albicans: A preliminary study

Indian journal of pharmacology, v. 37, Issue 5, 2005, p. 334-335
Sehgal, R.; Arya, Sunil; Kumar, VL
Article

Computational Geometry: Proximity and Location

Handbook of data structures and applications / Edited by Dinesh P. Mehta, Sartaj Sahni. Boca Raton, Florida : Chapman and Hall/CRC, 2004, Chapter 63
Arya, Sunil; Mount, David
Book chapter

Space-time tradeoffs for approximate spherical range counting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, p. 535-544
Arya, Sunil; Malamatos, Theocharis; Mount, D.M.
Conference paper

2003 1

Expected-case Complexity of Approximate Nearest Neighbor Searching

SIAM journal on computing, v. 32, (3), 2003, p. 793-815
Arya, Sunil; Fu, HYA
Article

2002 3

Binary space partitions for axis-parallel line segments: Size-height tradeoffs

Information Processing Letters, v. 84, (4), 2002, NOV 30, p. 201-206
Arya, Sunil
Article

Linear-size approximate Voronoi diagrams

PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, p. 147-155
Arya, Sunil; Malamatos, T.
Conference paper

Space-efficient approximate Voronoi diagrams

Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 2002, p. 721-730
Arya, Sunil; Malamatos, T.; Mount, D.M.
Conference paper

2001 3

Approximation algorithm for multiple-tool milling

International journal of computational geometry & applications, v. 11, (3), 2001, JUN, p. 339-372
Arya, Sunil; Cheng, SW; Mount, DM
Article

A simple entropy-based algorithm for planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, p. 262-268
Arya, S.; Malamatos, T.; Mount, D.M.
Conference paper

Entropy-preserving cuttings and space-efficient planar point location

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, p. 256-261
Arya, Sunil; Malamatos, T.; Mount, D.M.
Conference paper

2000 5

Approximate range searching

Computational Geometry: Theory and Applications, v. 17, (3-4), December 2000, p. 135-152
Arya, Sunil; Mount, David M.
Article

Efficient Expected-Case Algorithms for Planar Point Location

Lecture Notes in Computer Science, v. 1851, 2000, p. 353-366
Arya, Sunil; Cheng, Siu-Wing; Mount, David M.; Ramesh, H.
Article

Hardness of Set Cover with Intersection 1

Lecture Notes in Computer Science, v. 1853, 2000, p. 624-635
Anil Kumar, V. S.; Arya, Sunil; Ramesh, Honnasiddaiah S.
Article

Expected-case complexity of approximate nearest neighbor searching

PROC ANNU ACM SIAM SYMP DISCRETE ALGORITHMS, 2000, p. 379-388
Arya, Sunil; Fu, Ho-Yam Addy
Conference paper

Nearly Optimal Expected-Case Planar Point Location

Annual Symposium on Foundations of Computer Science - Proceedings, 2000, p. 208-218
Arya, Sunil; Malamatos, Theocharis; Mount, David M.
Conference paper

1999 2

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 13, (2), 1999, JUN, p. 91-107
Arya, Sunil; Mount, DM; Smid, M.
Article

On the expected depth of random circuits

COMBINATORICS Probability & COMPUTING, v. 8, (3), 1999, MAY, p. 209-227
Arya, Sunil; Golin, Mordecai Jay; Mehlhorn, Kurt
Article

1998 4

A 2.5-factor approximation algorithm for the k-MST problem

Information Processing Letters, v. 65, (3), 1998, FEB 13, p. 117-118
Arya, Sunil; Ramesh, H.
Article

An optimal algorithm for approximate nearest neighbor searching in fixed dimensions

JOURNAL OF THE ACM, v. 45, (6), 1998, NOV, p. 891-923
Arya, Sunil; Mount, DM; Netanyahu, NS; Silverman, R.; Wu, AY
Article

ANN: library for approximate nearest neighbor searching

Proceedings of IEEE CGC Workshop on Computational Geometry, Providence, RI, 1998, p. 33-40
Arya, Sunil; Mount, DM
Article

Approximation algorithms for multiple-tool miling

Proceedings of the fourteenth annual symposium on Computational geometry, 07-10 June 1998, p. 297-306
Arya, Sunil; Cheng, Siu Wing; Mount, David M.
Conference paper

1997 1

Efficient Construction of a Bounded Degree Spanner with Low Weight

Algorithmica, v. 17, 1997, p. 33-54
Arya, Sunil; Smid, M.
Article

1996 2

Accounting for Boundary Effects in Nearest-Neighbor Searching

Discrete & Computational Geometry, v. 16, (2), 1996, SEP, p. 155-176
Arya, Sunil; Mount, DM; Narayan, O.
Article

Nearest neighbor searching and applications

University of Maryland at College Park, 3 Oct 1996
Arya, Sunil
Conference paper

1995 3

Accounting for boundary effects in nearest neighbor searching

Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG), 1995, p. 336–344
Arya, Sunil; Mount, D.M.; Narayan, O.
Conference paper

Approximate range searching

Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG), 1995, p. 172–181
Arya, Sunil; Mount, D.M.
Conference paper

Euclidean spanners: short, thin and lanky

Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC), 1995, p. 489–498
Arya, Sunil; Das, G.; Mount, D.M.; Salowe, J.S.; Smid, M.
Conference paper

1994 3

An optimal algorithm for approximate nearest neighbor searching

Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994, p. 573–582
Arya, Sunil; Mount, D.M.; Netanyahu, N.S.; Silverman, R.; Wu, A.
Conference paper

Efficient construction of a bounded degree spanner with low weight

Proceedings of the 2nd Annual European Symposium on Algorithms (ESA), v. 855, Lecture Notes in Computer Science, Springer-Verlag, 1994, p. 48–59
Arya, Sunil; Smid, M.
Conference paper

Randomized and deterministic algorithms for geometric spanners of small diameter

Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS), 1994, p. 703–712
Arya, Sunil; Mount, D.M.; Smid, M.
Conference paper

1993 2

Algorithms for Fast Vector Quantization

Proceedings of the IEEE Data Compression Conference (DCC), Edited by J. A. Storer and M. Cohn. IEEE Press, 1993, p. 381–390
Arya, Sunil; Mount, D.M.
Conference paper

Approximate Nearest Neighbor Queries in Fixed Dimensions

Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993, p. 271–280
Arya, Sunil; Mount, D.M.
Conference paper

1991 1

Textural Analysis of Range Images

Pattern Recognition Letters, v. 12, 1991, p. 619–626
Arya, Sunil; DeMenthon, D.; Meer, P.; Davis, L.S.
Article

1982 1

Optimal scheduling of assembly language kernels for vector processors

Annual Allerton Conference on Communication, Control, and Computing, 19 th, Monticello, IL, 1982, p. 486-493
Arya, Sunil; Calahan, Da
Conference paper

No Publications

Teaching Assignment

2024-25 Fall 2 2023-24 Summer 1 2023-24 Spring 3 2023-24 Winter 0 2023-24 Fall 2 2022-23 Summer 1

COMP3711H	Honors Design and Analysis of Algorithms
COMP4981	Final Year Project

COMP4981

Final Year Project

COMP2711	Discrete Mathematical Tools for Computer Science
COMP4981	Final Year Project
CPEG4901	Computer Engineering Final Year Project in COMP

COMP2711H	Honors Discrete Mathematical Tools for Computer Science
COMP4981	Final Year Project

COMP4981

Final Year Project

No Teaching Assignments

Projects

From January 2022 to December 2024

All Projects 2

No Projects.
On the Difficulty of Separation

分離問題的研究 Leading

RGC - General Research Fund
Project Team (HKUST)
ARYA Sunil (Lead)
2022 - 2024
Approximation algorithms for proximity problems with alternative distance measures

另類度量下接近度問題的近似算法 Leading

RGC - General Research Fund
Project Team (HKUST)
ARYA Sunil (Lead)
2020 - 2022