-
S. Arya, G. D. da Fonseca, and D. M. Mount
Approximate Polytope Membership Queries,
SIAM J. Comput. 47, 2018, 1-51.
(doi: 10.1137/16M1061096)
-
S. Arya, G. D. da Fonseca, and D. M. Mount
Optimal Approximate Polytope Membership,
28th Annu. ACM-SIAM Sympos. on Discrete Algorithms, (SODA'17), 2017, 270--288.
(doi: 10.1137/1.9781611974782.18)
-
S. Har-Peled, N. Kumar, D. M. Mount, and B. Raichel,
Space Exploration via Proximity Search,
Discrete and Computational Geometry 56, 2016, 357-376.
(doi: 10.1007/s00454-016-9801-7)
-
S. Arya, D. M. Mount, and E. Park,
Approximate Geometric MST Range Queries,
Proc. 31st Internat. Sympos. on Computational Geometry (SoCG'15), 2015, 781-795.
(doi: 10.4230/LIPIcs.SOCG.2015.781)
-
S. Arya, G. da Fonseca, D. M. Mount,
Optimal Area-sensitive Bounds for Polytope Approximation,
Proc. 28th Annu. Sympos. on Computational Geometry (SoCG'12), 2012, 363-372.
(doi: 10.1145/2261250.2261305)
-
S. Arya, D. M. Mount. and J. Xia,
Tight Lower Bounds for Halfspace Range Searching,
Discrete and Computational Geometry 47 (2012), 711-730. (doi: 10.1007/s00454-012-9412-x)
-
S. Arya, G. D. da Fonseca, and D. M. Mount,
Polytope Approximation and the Mahler Volume,
23rd Annu. ACM-SIAM Sympos. on Discrete Algorithms, (SODA'12), 2012, 29-42. (doi: 10.1137/1.9781611973099.3)
-
S. Arya, G. D. da Fonseca, and D. M. Mount,
Approximate Polytope Membership Queries,
Proc. 43rd ACM Sympos. on Theory of Computing (STOC'11), 2011, 579-586. (doi: 10.1145/1993636.1993713)
-
S. Arya, G. D. da Fonseca, and D. M. Mount,
A Unified Approach to Approximate Proximity Searching,
Proc. 18th Annu. European Sympos. Algorithms (ESA'10), 2010, 374-385. (doi: 10.1007/978-3-642-15775-2_32)
-
S. A. Friedler and D. M. Mount,
Spatio-temporal Range Searching Over Compressed Kinetic Sensor Data,
Proc. 18th Annu. European Sympos. Algorithms (ESA'10), 2010, 386-397. (doi: 10.1007/978-3-642-15775-2_33)
-
D. M. Mount and E. Park,
A Dynamic Data Structure for Approximate Range Searching,
Proc. 26th Annu. Sympos. on Computational Geometry (SoCG'10), 2010, 247-256. (doi: 10.1145/1810959.1811002)
-
G. D. da Fonseca and D. M. Mount,
Approximate range searching: The absolute model,
Comput. Geom. Theory Appl., 43 (2010), 434-444. (doi: 10.1016/j.comgeo.2008.09.009)
-
S. Arya, T. Malamatos, and D. M. Mount,
Space-time tradeoffs for approximate nearest neighbor searching,
Journal of the ACM, 57 (2009), 1-54. (doi: 10.1145/1613676.1613677)
-
S. Arya, T. Malamatos, and D. M. Mount,
The Effect of Corners on the Complexity of Approximate Range Searching,
Discrete and Computational Geometry, 41 (2009), 398-443. (doi: 10.1007/s00454-009-9140-z)
-
S. Arya, G. D. da Fonseca, D. M. Mount,
Tradeoffs in Approximate Range Searching Made Simpler,
Proc. 2008 XXI Brazilian Sympos. on Computer Graphics and Image Processing (SIBGRAPI'08), 2008, 237-244. (doi: 10.1109/SIBGRAPI.2008.24)
-
S. Arya, D. M. Mount, A. Vigneron, and J. Xia,
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces,
Proc. 16th Annu. European Sympos. Algorithms (ESA'08), 2008, 112-123. (doi: 10.1007/978-3-540-87744-8_10)
-
S. Arya, T. Malamatos, and D. M. Mount,
On the Importance of Idempotence,
Proc. 38th ACM Sympos. on Theory of Computing (STOC'06), 2006, 564-573. (doi: 10.1145/1132516.1132598)
-
S. Arya, T. Malamatos, and D. M. Mount,
Space-Time Tradeoffs for Approximate Spherical Range Counting,
16th Annu. ACM-SIAM Sympos. on Discrete Algorithms, (SODA'05), 2005, 535-544.
(Full version: Univ. of Maryland, Dept. of Computer Science Technical Report CS-TR-4842, Nov 2006.)
-
S. Arya, T. Malamatos, and D. M. Mount,
Space-Efficient Approximate Voronoi Diagrams,
Proc. 34th ACM Sympos. on Theory of Computing (STOC'02), 2002, 721-730.
-
S. Maneewongvatana and D. M. Mount,
Analysis of Approximate Nearest Neighbor Searching with Clustered Point Sets,
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, eds. M. H. Goldwasser, D. S. Johnson, C. C. McGeoch, in the DIMACS Series in Discr. Math. and Theoret. Comp. Sci., Vol. 59, AMS, 2002, 105-123.
-
S. Maneewongvatana and D. M. Mount,
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching,
Proc. 7th Workshop on Algorithms and Data Structures (WADS'01), 2001, 276-286.
-
S. Maneewongvatana and D. M. Mount,
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions,
Internat. Conf. on Computational Science (ICCS'01), Springer Lecture Notes LNCS 2073, 2001, 842-851.
(Full version: Univ. of Maryland, Dept. of Computer Science Technical Report CS-TR-4209, 2001.)
-
S. Maneewongvatana and D. M. Mount,
An Empirical Study of a New Approach to Nearest Neighbor Searching,
3rd Internat. Workshop on Algorithm Engineering and Experiments (ALENEX'01), Springer Lecture Notes LNCS 2153, 2001, 172-187.
-
S. Arya and D. M. Mount,
Approximate Range Searching,
Computational Geometry: Theory and Applications, 17 (2000), 135-163.
-
D. M. Mount, N. Netanyahu, R. Silverman, A. Y. Wu,
Chromatic nearest neighbor searching: A query sensitive approach,,
Computational Geometry: Theory and Applications, 17 (2000), 97-119.
-
S. Maneewongvatana and D. M. Mount,
It's Okay to be Skinny, If Your Friends are Fat,
4th Annual CGC Workshop on Comptutational Geometry, 1999.
-
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu,
An Optimal Algorithm for Approximate Nearest Neighbor Searching,
Journal of the ACM, 45 (1998), 891-923.
-
S. Arya, D. M. Mount, and O. Narayan,
Accounting for Boundary Effects in Nearest Neighbor Searching,
Discrete and Computational Geometry, 16 (1996), 155-176.
-
S. Arya and D. M. Mount,
Algorithms for Fast Vector Quantization,
Proc. of the Data Compression Conf. (DCC'93), eds. J. A. Storer and M. Cohn, IEEE Press, 1993, 381-390. (Revised).
-
S. Arya and D. M. Mount,
Approximate Nearest Neighbor Searching,
Proc. 4th Annu. ACM-SIAM Sympos. on Discrete Algorithms (SODA'93), 1993, 271-280.
|