An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Zbl 1065.68650
Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela Y. |
|
1998
|
Euclidean spanners: Short, thin, and lanky. Zbl 0968.68533
Arya, Sunil; Das, Gautam; Mount, David M.; Salowe, Jeffrey S.; Smid, Michiel |
|
1995
|
Approximate range searching. Zbl 0968.68167
Arya, Sunil; Mount, David M. |
|
2000
|
Approximate nearest neighbor queries in fixed dimensions. Zbl 0801.68161
Arya, Sunil; Mount, David M. |
|
1993
|
Hardness of set cover with intersection 1. Zbl 0973.68080
Anil Kumar, V. S.; Arya, Sunil; Ramesh, H. |
|
2000
|
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Zbl 0937.68137
Arya, Sunil; Mount, David M.; Smid, Michiel |
|
1999
|
An optimal algorithm for approximate nearest neighbor searching. Zbl 0871.68068
Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela |
|
1994
|
Space-time tradeoffs for approximate nearest neighbor searching. Zbl 1204.68103
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2009
|
Linear-size approximate Voronoi diagrams. Zbl 1058.65019
Arya, Sunil; Malamatos, Theocharis |
|
2002
|
Efficient construction of a bounded-degree spanner with low weight. Zbl 0864.68108
Arya, S.; Smid, M. |
|
1997
|
Space-efficient approximate Voronoi diagrams. Zbl 1192.68727
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2002
|
A 2.5-factor approximation algorithm for the \(k\)-MST problem. Zbl 1338.68287
Arya, Sunil; Ramesh, H. |
|
1998
|
On the expected depth of random circuits. Zbl 0941.68001
Arya, Sunil; Golin, Mordecai J.; Mehlhorn, Kurt |
|
1999
|
Optimal expected-case planar point location. Zbl 1137.68021
Arya, Sunil; Malamatos, Theocharis; Mount, David M.; Wong, Ka Chun |
|
2007
|
On the combinatorial complexity of approximating polytopes. Zbl 1381.52031
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2017
|
Approximate polytope membership queries. Zbl 1288.68219
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2011
|
Tight lower bounds for halfspace range searching. Zbl 1248.68210
Arya, Sunil; Mount, David M.; Xia, Jian |
|
2012
|
Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels. Zbl 1395.68278
Arya, Sunil; Chan, Timothy M. |
|
2014
|
On the importance of idempotence. Zbl 1301.68263
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2006
|
Accounting for boundary effects in nearest-neighbor searching. Zbl 0853.68081
Arya, S.; Mount, D. M.; Narayan, O. |
|
1996
|
Optimal approximate polytope membership. Zbl 1410.68363
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2017
|
Optimal area-sensitive bounds for polytope approximation. Zbl 1293.52013
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2012
|
A simple entropy-based algorithm for planar point location. Zbl 1321.68429
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2007
|
Space-time tradeoffs for approximate spherical range counting. Zbl 1297.68228
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2005
|
Entropy-preserving cuttings and space-efficient planar point location. Zbl 0987.68082
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2001
|
A simple entropy-based algorithm for planar point location. Zbl 0987.68083
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2001
|
The effect of corners on the complexity of approximate range searching. Zbl 1165.68060
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2009
|
Efficient expected-case algorithms for planar point location. Zbl 0966.68521
Arya, Sunil; Cheng, Siu-Wing; Mount, David M.; Ramesh, H. |
|
2000
|
Approximate polytope membership queries. Zbl 1381.52019
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2018
|
Near-optimal \(\varepsilon\)-kernel construction and related problems. Zbl 1432.68483
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M. |
|
2017
|
Polytope approximation and the Mahler volume. Zbl 1422.68240
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2012
|
A unified approach to approximate proximity searching. Zbl 1287.68025
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2010
|
Expected-case complexity of approximate nearest neighbor searching. Zbl 1046.68041
Arya, Sunil; Fu, Ho-Yam Addy |
|
2003
|
Approximate nearest neighbor searching with non-Euclidean and weighted distances. Zbl 1431.68112
Abdelkader, Ahmed; Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M. |
|
2019
|
Tight lower bounds for halfspace range searching. Zbl 1284.68579
Arya, Sunil; Mount, David M.; Xia, Jian |
|
2010
|
Approximation algorithm for multiple-tool milling. Zbl 1074.68670
Arya, Sunil; Cheng, Siu-Wing; Mount, David M. |
|
2001
|
The effect of corners on the complexity of approximate range searching. Zbl 1153.68520
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2006
|
Space-time tradeoffs for proximity searching in doubling spaces. Zbl 1158.68524
Arya, Sunil; Mount, David M.; Vigneron, Antoine; Xia, Jian |
|
2008
|
Binary space partitions for axis-parallel line segments: Size-height tradeoffs. Zbl 1042.68107
Arya, Sunil |
|
2002
|
A fast and simple algorithm for computing approximate Euclidean minimum spanning trees. Zbl 1410.68393
Arya, Sunil; Mount, David M. |
|
2016
|
Optimal bound on the combinatorial complexity of approximating polytopes. Zbl 07758429
Arya, Rahul; Arya, Sunil; da Fonseca, Guilherme D.; Mount, David |
|
2022
|
Computational geometry: proximity and location. Zbl 1387.68232
Arya, Sunil; Mount, David M. |
|
2018
|
On the combinatorial complexity of approximating polytopes. Zbl 1387.52007
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2016
|
Approximate geometric MST range queries. Zbl 1378.68151
Arya, Sunil; Mount, David M.; Park, Eunhui |
|
2015
|
Optimal bound on the combinatorial complexity of approximating polytopes. Zbl 07758429
Arya, Rahul; Arya, Sunil; da Fonseca, Guilherme D.; Mount, David |
|
2022
|
Approximate nearest neighbor searching with non-Euclidean and weighted distances. Zbl 1431.68112
Abdelkader, Ahmed; Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M. |
|
2019
|
Approximate polytope membership queries. Zbl 1381.52019
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2018
|
Computational geometry: proximity and location. Zbl 1387.68232
Arya, Sunil; Mount, David M. |
|
2018
|
On the combinatorial complexity of approximating polytopes. Zbl 1381.52031
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2017
|
Optimal approximate polytope membership. Zbl 1410.68363
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2017
|
Near-optimal \(\varepsilon\)-kernel construction and related problems. Zbl 1432.68483
Arya, Sunil; Da Fonseca, Guilherme D.; Mount, David M. |
|
2017
|
A fast and simple algorithm for computing approximate Euclidean minimum spanning trees. Zbl 1410.68393
Arya, Sunil; Mount, David M. |
|
2016
|
On the combinatorial complexity of approximating polytopes. Zbl 1387.52007
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2016
|
Approximate geometric MST range queries. Zbl 1378.68151
Arya, Sunil; Mount, David M.; Park, Eunhui |
|
2015
|
Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels. Zbl 1395.68278
Arya, Sunil; Chan, Timothy M. |
|
2014
|
Tight lower bounds for halfspace range searching. Zbl 1248.68210
Arya, Sunil; Mount, David M.; Xia, Jian |
|
2012
|
Optimal area-sensitive bounds for polytope approximation. Zbl 1293.52013
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2012
|
Polytope approximation and the Mahler volume. Zbl 1422.68240
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2012
|
Approximate polytope membership queries. Zbl 1288.68219
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2011
|
A unified approach to approximate proximity searching. Zbl 1287.68025
Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. |
|
2010
|
Tight lower bounds for halfspace range searching. Zbl 1284.68579
Arya, Sunil; Mount, David M.; Xia, Jian |
|
2010
|
Space-time tradeoffs for approximate nearest neighbor searching. Zbl 1204.68103
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2009
|
The effect of corners on the complexity of approximate range searching. Zbl 1165.68060
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2009
|
Space-time tradeoffs for proximity searching in doubling spaces. Zbl 1158.68524
Arya, Sunil; Mount, David M.; Vigneron, Antoine; Xia, Jian |
|
2008
|
Optimal expected-case planar point location. Zbl 1137.68021
Arya, Sunil; Malamatos, Theocharis; Mount, David M.; Wong, Ka Chun |
|
2007
|
A simple entropy-based algorithm for planar point location. Zbl 1321.68429
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2007
|
On the importance of idempotence. Zbl 1301.68263
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2006
|
The effect of corners on the complexity of approximate range searching. Zbl 1153.68520
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2006
|
Space-time tradeoffs for approximate spherical range counting. Zbl 1297.68228
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2005
|
Expected-case complexity of approximate nearest neighbor searching. Zbl 1046.68041
Arya, Sunil; Fu, Ho-Yam Addy |
|
2003
|
Linear-size approximate Voronoi diagrams. Zbl 1058.65019
Arya, Sunil; Malamatos, Theocharis |
|
2002
|
Space-efficient approximate Voronoi diagrams. Zbl 1192.68727
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2002
|
Binary space partitions for axis-parallel line segments: Size-height tradeoffs. Zbl 1042.68107
Arya, Sunil |
|
2002
|
Entropy-preserving cuttings and space-efficient planar point location. Zbl 0987.68082
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2001
|
A simple entropy-based algorithm for planar point location. Zbl 0987.68083
Arya, Sunil; Malamatos, Theocharis; Mount, David M. |
|
2001
|
Approximation algorithm for multiple-tool milling. Zbl 1074.68670
Arya, Sunil; Cheng, Siu-Wing; Mount, David M. |
|
2001
|
Approximate range searching. Zbl 0968.68167
Arya, Sunil; Mount, David M. |
|
2000
|
Hardness of set cover with intersection 1. Zbl 0973.68080
Anil Kumar, V. S.; Arya, Sunil; Ramesh, H. |
|
2000
|
Efficient expected-case algorithms for planar point location. Zbl 0966.68521
Arya, Sunil; Cheng, Siu-Wing; Mount, David M.; Ramesh, H. |
|
2000
|
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Zbl 0937.68137
Arya, Sunil; Mount, David M.; Smid, Michiel |
|
1999
|
On the expected depth of random circuits. Zbl 0941.68001
Arya, Sunil; Golin, Mordecai J.; Mehlhorn, Kurt |
|
1999
|
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Zbl 1065.68650
Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela Y. |
|
1998
|
A 2.5-factor approximation algorithm for the \(k\)-MST problem. Zbl 1338.68287
Arya, Sunil; Ramesh, H. |
|
1998
|
Efficient construction of a bounded-degree spanner with low weight. Zbl 0864.68108
Arya, S.; Smid, M. |
|
1997
|
Accounting for boundary effects in nearest-neighbor searching. Zbl 0853.68081
Arya, S.; Mount, D. M.; Narayan, O. |
|
1996
|
Euclidean spanners: Short, thin, and lanky. Zbl 0968.68533
Arya, Sunil; Das, Gautam; Mount, David M.; Salowe, Jeffrey S.; Smid, Michiel |
|
1995
|
An optimal algorithm for approximate nearest neighbor searching. Zbl 0871.68068
Arya, Sunil; Mount, David M.; Netanyahu, Nathan S.; Silverman, Ruth; Wu, Angela |
|
1994
|
Approximate nearest neighbor queries in fixed dimensions. Zbl 0801.68161
Arya, Sunil; Mount, David M. |
|
1993
|