| 2011 |
| 43 | New approaches to robust, point-based image registration. David M. Mount, Nathan S. Netanyahu, San Ratanasanya. Image Registration for Remote Sensing 2011, 179-199. Web SearchBibTeX |
| 2007 |
| 42 | A practical approximation algorithm for the LMS line estimator. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu. Computational Statistics & Data Analysis (51): 2461-2486 (2007). Web SearchBibTeXDownload |
| 41 | A Fast Implementation of the Isodata Clustering Algorithm. Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne. Int. J. Comput. Geometry Appl. (17): 71-103 (2007). Web SearchBibTeXDownload |
| 2006 |
| 40 | Proximity problems on line segments spanned by points. Ovidiu Daescu, Jun Luo, David M. Mount. Comput. Geom. (33): 115-129 (2006). Web SearchBibTeXDownload |
| 39 | On the Least Median Square Problem. Jeff Erickson, Sariel Har-Peled, David M. Mount. Discrete & Computational Geometry (36): 593-607 (2006). Web SearchBibTeXDownload |
| 2005 |
| 38 | Proximity Problems on Line Segments Spanned by Points. Ovidiu Daescu, Jun Luo, David M. Mount. CCCG 2005, 227-231. Web SearchBibTeXDownload |
| 2004 |
| 37 | A local search approximation algorithm for k-means clustering. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. Comput. Geom. (28): 89-112 (2004). Web SearchBibTeXDownload |
| 36 | A computational framework for incremental motion. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. Symposium on Computational Geometry 2004, 200-209. Web SearchBibTeXDownload |
| 35 | On the least median square problem. Jeff Erickson, Sariel Har-Peled, David M. Mount. Symposium on Computational Geometry 2004, 273-279. Web SearchBibTeXDownload |
| 2002 |
| 34 | Algorithmic issues in modeling motion. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload |
| 33 | An Efficient k-Means Clustering Algorithm: Analysis and Implementation. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. IEEE Trans. Pattern Anal. Mach. Intell. (24): 881-892 (2002). Web SearchBibTeXDownload |
| 32 | A local search approximation algorithm for k-means clustering. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. Symposium on Computational Geometry 2002, 10-18. Web SearchBibTeXDownload |
| 2001 |
| 31 | Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. David M. Mount, Nathan S. Netanyahu. Comput. Geom. (19): 1-33 (2001). Web SearchBibTeXDownload |
| 30 | Approximating large convolutions in digital images. David M. Mount, Tapas Kanungo, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. IEEE Transactions on Image Processing (10): 1826-1835 (2001). Web SearchBibTeXDownload |
| 29 | A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. Michael Murphy, David M. Mount, Carl W. Gable. Int. J. Comput. Geometry Appl. (11): 669-682 (2001). Web SearchBibTeX |
| 28 | Approximation Algorithm for Multiple-Tool Milling. Sunil Arya, Siu-Wing Cheng, David M. Mount. Int. J. Comput. Geometry Appl. (11): 339-372 (2001). Web SearchBibTeX |
| 27 | Algorithms for facility location problems with outliers. Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan. SODA 2001, 642-651. Web SearchBibTeXDownload |
| 2000 |
| 26 | Chromatic nearest neighbor searching: A query sensitive approach. David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu. Comput. Geom. (17): 97-119 (2000). Web SearchBibTeXDownload |
| 25 | Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. Int. J. Comput. Geometry Appl. (10): 593-608 (2000). Web SearchBibTeX |
| 24 | A point-placement strategy for conforming Delaunay tetrahedralization. Michael Murphy, David M. Mount, Carl W. Gable. SODA 2000, 67-74. Web SearchBibTeXDownload |
| 23 | Efficient Expected-Case Algorithms for Planar Point Location. Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan. SWAT 2000, 353-366. Web SearchBibTeXDownload |
| 22 | The analysis of a simple k-means clustering algorithm. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. Symposium on Computational Geometry 2000, 100-109. Web SearchBibTeXDownload |
| 1999 |
| 21 | Efficient algorithms for robust feature matching. David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne. Pattern Recognition (32): 17-38 (1999). Web SearchBibTeXDownload |
| 20 | Computing Nearest Neighbors for Moving Points and Applications to Clustering. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. SODA 1999, 931-932. Web SearchBibTeXDownload |
| 1998 |
| 19 | Efficient Randomized Algorithms for the Repeated Median Line Estimator. Jirí Matousek, David M. Mount, Nathan S. Netanyahu. Algorithmica (20): 136-150 (1998). Web SearchBibTeXDownload |
| 18 | Quantile approximation for robust statistical estimation. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. CCCG 1998. Web SearchBibTeXDownload |
| 17 | An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu. J. ACM (45): 891-923 (1998). Web SearchBibTeXDownload |
| 16 | Approximation Algorithms for Multiple-Tool Miling. Sunil Arya, Siu-Wing Cheng, David M. Mount. Symposium on Computational Geometry 1998, 297-306. Web SearchBibTeXDownload |
| 15 | Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne. Symposium on Computational Geometry 1998, 155-164. Web SearchBibTeXDownload |
| 1997 |
| 14 | Testing Simple Polygons. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine. Comput. Geom. (8): 97-114 (1997). Web SearchBibTeXDownload |
| 13 | Parallelizing and Algorithm for Visibility on Polyhedral Terrain. Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis. Int. J. Comput. Geometry Appl. (7): 75-84 (1997). Cited by 7Web SearchBibTeX |
| 12 | Query-Sensitive Ray Shooting. Joseph S. B. Mitchell, David M. Mount, Subhash Suri. Int. J. Comput. Geometry Appl. (7): 317-347 (1997). Web SearchBibTeX |
| 11 | A Practical Approximation Algorithm for the LMS Line Estimator. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu. SODA 1997, 473-482. Web SearchBibTeXDownload |
| 1995 |
| 10 | Euclidean spanners: short, thin, and lanky. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid. STOC 1995, 489-498. Cited by 150Web SearchBibTeXDownload |
| 1994 |
| 9 | Computationally Efficient Algorithms for High-Dimensional Robust Estimators. David M. Mount, Nathan S. Netanyahu. CVGIP: Graphical Model and Image Processing (56): 289-303 (1994). Web SearchBibTeXDownload |
| 8 | An Optimal Algorithm for Approximate Nearest Neighbor Searching. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu. SODA 1994, 573-582. Web SearchBibTeXDownload |
| 7 | Query-Sensitive Ray Shooting. Joseph S. B. Mitchell, David M. Mount, Subhash Suri. Symposium on Computational Geometry 1994, 359-368. Web SearchBibTeXDownload |
| 1993 |
| 6 | Testing Simple Polygons. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine. CCCG 1993, 387. Web SearchBibTeX |
| 5 | Efficient Algorithms for Robust Circular Arc Estimators. David M. Mount, Nathan S. Netanyahu. CCCG 1993, 79-84. Web SearchBibTeX |
| 4 | Efficient Randomized Algorithms for the Repeated Median Line Estimator. Jirí Matousek, David M. Mount, Nathan S. Netanyahu. SODA 1993, 74-82. Web SearchBibTeXDownload |
| 3 | Point Probe Decision Trees for Geometric Concept Classes. Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena. WADS 1993, 95-106. Web SearchBibTeXDownload |
| 1992 |
| 2 | A randomized algorithm for slope selection. Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu. Int. J. Comput. Geometry Appl. (2): 1-27 (1992). Web SearchBibTeX |
| 1987 |
| 1 | The Discrete Geodesic Problem. Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou. SIAM J. Comput. (16): 647-668 (1987). Web SearchBibTeXDownload |