David M. Mount

ORCID

Publication Activity (10 Years)

Years Active: 1982-2023
Publications (10 Years): 57

Top Venues

Publications

Sunil Arya, David M. Mount
Optimal Volume-Sensitive Bounds for Polytope Approximation. CoRR (2023)
Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount
Delaunay Triangulations in the Hilbert Metric. CoRR (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. CoRR (2023)
Aditya Acharya, David M. Mount
Tracking Evolving labels using Cone based Oracles. CoRR (2023)
Ahmed Abdelkader, David M. Mount
Smooth Distance Approximation. CoRR (2023)
Auguste H. Gezalyan, David M. Mount
Voronoi Diagrams in the Hilbert Metric. SoCG (2023)
Sunil Arya, David M. Mount
Optimal Volume-Sensitive Bounds for Polytope Approximation. SoCG (2023)
Madeline Bumpus, Xufeng Caesar Dai, Auguste H. Gezalyan, Sam Munoz, Renita Santhoshkumar, Songyu Ye, David M. Mount
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. CoRR (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR (2023)
Ahmed Abdelkader, Sunil Arya, Guilherme D. da Fonseca, David M. Mount
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR (2023)
Ahmed Abdelkader, David M. Mount
Smooth Distance Approximation. ESA (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SODA (2023)
Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CoRR (2022)
Aditya Acharya, David M. Mount
Optimally Tracking Labels on an Evolving Tree. CCCG (2022)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms 18 (4) (2022)
Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M. Mount, Hanan Samet
Proximity Queries on Terrain Surface. ACM Trans. Database Syst. 47 (4) (2022)
Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
Optimally Confining Lattice Polymers. CCCG (2022)
Aditya Acharya, David M. Mount
Optimally Tracking Labels on an Evolving Tree. CoRR (2022)
Mary Monroe, David M. Mount
A PTAS for the Min-Max Euclidean Multiple TSP. CoRR (2021)
Alejandro Flores-Velazco, David M. Mount
Guarantees on nearest-neighbor condensation heuristics. Comput. Geom. 95 (2021)
Alejandro Flores-Velazco, David M. Mount
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. ESA (2021)
Ahmed Abdelkader, David M. Mount
Approximate Nearest-Neighbor Search for Line Segments. CoRR (2021)
Auguste H. Gezalyan, David M. Mount
Voronoi Diagrams in the Hilbert Metric. CoRR (2021)
Ahmed Abdelkader, David M. Mount
Approximate Nearest-Neighbor Search for Line Segments. SoCG (2021)
Alejandro Flores-Velazco, David M. Mount
Coresets for the Nearest-Neighbor Rule. CoRR (2020)
Alejandro Flores-Velazco, David M. Mount
Coresets for the Nearest-Neighbor Rule. ESA (2020)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA (2020)
Alejandro Flores-Velazco, David M. Mount
Guarantees on Nearest-Neighbor Condensation heuristics. CCCG (2019)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR (2019)
Philip Dasler, David M. Mount
Online Algorithms for Warehouse Management. ISAAC (2019)
F. Betül Atalay, David M. Mount
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions. Comput. Geom. 79 (2019)
Alejandro Flores-Velazco, David M. Mount
Guarantees on Nearest-Neighbor Condensation heuristics. CoRR (2019)
David M. Mount
New Directions in Approximate Nearest-Neighbor Searching. CALDAM (2019)
Philip Dasler, David M. Mount
Modular Circulation and Applications to Traffic Management. Algorithmica 81 (10) (2019)
Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA (2019)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Polytope Membership Queries. SIAM J. Comput. 47 (1) (2018)
Ahmed Abdelkader, David M. Mount
Economical Delone Sets for Approximating Convex Bodies. SWAT (2018)
Philip Dasler, David M. Mount
Modular Circulation and Applications to Traffic Management. WADS (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58 (4) (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Near-Optimal ε-Kernel Construction and Related Problems. CoRR (2017)
Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M. Mount
Distance Oracle on Terrain Surface. SIGMOD Conference (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Approximate Polytope Membership. SODA (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Approximate Polytope Membership. CoRR (2016)
Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
Space Exploration via Proximity Search. Discret. Comput. Geom. 56 (2) (2016)
David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Angela Y. Wu, Ruth Silverman
A practical approximation algorithm for the LTS estimator. Comput. Stat. Data Anal. 99 (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. CoRR (2016)
Sunil Arya, David M. Mount
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. SODA (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Polytope Membership Queries. CoRR (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. SoCG (2016)
Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
Space Exploration via Proximity Search. SoCG (2015)
Philip Dasler, David M. Mount
On the Complexity of an Unregulated Traffic Crossing. CoRR (2015)
Sunil Arya, David M. Mount, Eunhui Park
Approximate Geometric MST Range Queries. SoCG (2015)
Sorelle A. Friedler, David M. Mount
A sensor-based framework for kinetic data compression. Comput. Geom. 48 (3) (2015)
Philip Dasler, David M. Mount
On the Complexity of an Unregulated Traffic Crossing. WADS (2015)
David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
On the Least Trimmed Squares Estimator. Algorithmica 69 (1) (2014)
Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
Space Exploration via Proximity Search. CoRR (2014)
Prayaag Venkat, David M. Mount
A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets. CCCG (2014)
Eunhui Park, David M. Mount
Output-sensitive well-separated pair decompositions for dynamic point sets. SIGSPATIAL/GIS (2013)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal area-sensitive bounds for polytope approximation. SCG (2012)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Polytope approximation and the Mahler volume. SODA (2012)
Sunil Arya, David M. Mount, Jian Xia
Tight Lower Bounds for Halfspace Range Searching. Discret. Comput. Geom. 47 (4) (2012)
Xiangzhi Wei, Ajay Joneja, David M. Mount
Optimal uniformly monotone partitioning of polygons with holes. Comput. Aided Des. 44 (12) (2012)
Eunhui Park, David M. Mount
A Self-adjusting Data Structure for Multidimensional Point Sets. ESA (2012)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate polytope membership queries. STOC (2011)
Sunil Arya, David M. Mount, Jian Xia
Tight lower bounds for halfspace range searching. SCG (2010)
Sorelle A. Friedler, David M. Mount
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. ESA (1) (2010)
Sorelle A. Friedler, David M. Mount
Approximation algorithm for the kinetic robust K-center problem. Comput. Geom. 43 (6-7) (2010)
Guilherme Dias da Fonseca, David M. Mount
Approximate range searching: The absolute model. Comput. Geom. 43 (4) (2010)
David M. Mount, Eunhui Park
A dynamic data structure for approximate range searching. SCG (2010)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
A Unified Approach to Approximate Proximity Searching. ESA (1) (2010)
Sunil Arya, Theocharis Malamatos, David M. Mount
Space-time tradeoffs for approximate nearest neighbor searching. J. ACM 57 (1) (2009)
Sunil Arya, Theocharis Malamatos, David M. Mount
The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. 41 (3) (2009)
Sorelle A. Friedler, David M. Mount
Compressing Kinetic Data from Sensor Networks. ALGOSENSORS (2009)
Minkyoung Cho, David M. Mount, Eunhui Park
Maintaining Nets and Net Trees under Incremental Motion. ISAAC (2009)
Minkyoung Cho, David M. Mount
Embedding and similarity search for point sets under translation. SCG (2008)
Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA (2008)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI (2008)
Minkyoung Cho, David M. Mount
Improved Approximation Bounds for Planar Point Pattern Matching. Algorithmica 50 (2) (2008)
David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
A practical approximation algorithm for the LMS line estimator. Comput. Stat. Data Anal. 51 (5) (2007)
Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
A Fast Implementation of the Isodata Clustering Algorithm. Int. J. Comput. Geom. Appl. 17 (1) (2007)
Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong
Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37 (2) (2007)
Nargess Memarsadeghi, David M. Mount
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. International Conference on Computational Science (2) (2007)
Sunil Arya, Theocharis Malamatos, David M. Mount
A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms 3 (2) (2007)
F. Betül Atalay, David M. Mount
Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. Int. J. Comput. Geom. Appl. 17 (6) (2007)
Jacqueline Le Moigne, Arlene A. Cole-Rhodes, Roger D. Eastman, Peyush Jain, Aimee Joshua, Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jeffrey T. Morisette, Ezinne Uko-Ozoro
Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data. ICASSP (5) (2006)
Ovidiu Daescu, Jun Luo, David M. Mount
Proximity problems on line segments spanned by points. Comput. Geom. 33 (3) (2006)
David M. Mount
Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. CCCG (2006)
Jeff Erickson, Sariel Har-Peled, David M. Mount
On the Least Median Square Problem. Discret. Comput. Geom. 36 (4) (2006)
F. Betül Atalay, David M. Mount
The Cost of Compatible Refinement of Simplex Decomposition Trees. IMR (2006)
Nargess Memarsadeghi, Jacqueline Le Moigne, David M. Mount
Image Fusion Using Cokriging. IGARSS (2006)
Sunil Arya, Theocharis Malamatos, David M. Mount
The effect of corners on the complexity of approximate range searching. SCG (2006)
David M. Mount
Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. ALENEX (2006)
Sunil Arya, Theocharis Malamatos, David M. Mount
On the importance of idempotence. STOC (2006)
Ovidiu Daescu, Jun Luo, David M. Mount
Proximity Problems on Line Segments Spanned by Points. CCCG (2005)
David M. Mount
Editorial. Comput. Geom. 31 (1-2) (2005)
Sunil Arya, Theocharis Malamatos, David M. Mount
Space-time tradeoffs for approximate spherical range counting. SODA (2005)
Minkyoung Cho, David M. Mount
Improved Approximation Bounds for Planar Point Pattern Matching. WADS (2005)

David M. Mount.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David M. Mount