An efficient k-means clustering algorithm: Analysis and implementation T Kanungo, DM Mount, NS Netanyahu, CD Piatko, R Silverman, AY Wu IEEE transactions on pattern analysis and machine intelligence 24 (7), 881-892, 2002 | 6988 | 2002 |

An optimal algorithm for approximate nearest neighbor searching fixed dimensions S Arya, DM Mount, NS Netanyahu, R Silverman, AY Wu Journal of the ACM (JACM) 45 (6), 891-923, 1998 | 3873 | 1998 |

The discrete geodesic problem JSB Mitchell, DM Mount, CH Papadimitriou SIAM Journal on Computing 16 (4), 647-668, 1987 | 907 | 1987 |

A local search approximation algorithm for k-means clustering T Kanungo, DM Mount, NS Netanyahu, CD Piatko, R Silverman, AY Wu Proceedings of the eighteenth annual symposium on Computational geometry, 10-18, 2002 | 878 | 2002 |

Approximate nearest neighbor queries in fixed dimensions. S Arya, DM Mount SODA 93, 271-280, 1993 | 635 | 1993 |

ANN: A library for approximate nearest neighbor searching DM Mount http://www. cs. umd. edu/~ mount/ANN/, 2010 | 525 | 2010 |

Algorithms for facility location problems with outliers M Charikar, S Khuller, DM Mount, G Narasimhan SODA 1, 642-651, 2001 | 508 | 2001 |

An output-sensitive algorithm for computing visibility graphs SK Ghosh, DM Mount SIAM Journal on Computing 20 (5), 888-910, 1991 | 476 | 1991 |

A fast implementation of the ISODATA clustering algorithm N Memarsadeghi, DM Mount, NS Netanyahu, J Le Moigne International Journal of Computational Geometry & Applications 17 (01), 71-103, 2007 | 273 | 2007 |

Isomorphism of graphs with bounded eigenvalue multiplicity L Babai, DY Grigoryev, DM Mount Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 273 | 1982 |

Euclidean spanners: short, thin, and lanky S Arya, G Das, DM Mount, JS Salowe, M Smid Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 261 | 1995 |

Algorithms for fast vector quantization S Arya, DM Mount [Proceedings] DCC93: Data Compression Conference, 381-390, 1993 | 249 | 1993 |

Efficient algorithms for robust feature matching DM Mount, NS Netanyahu, J Le Moigne Pattern recognition 32 (1), 17-38, 1999 | 235 | 1999 |

The analysis of a simple *k*-means clustering algorithmT Kanungo, DM Mount, NS Netanyahu, C Piatko, R Silverman, AY Wu Proceedings of the sixteenth annual symposium on Computational geometry, 100-109, 2000 | 178 | 2000 |

It’s okay to be skinny, if your friends are fat S Maneewongvatana, DM Mount Center for geometric computing 4th annual workshop on computational geometry …, 1999 | 161 | 1999 |

Approximate range searching S Arya, DM Mount Computational Geometry 17 (3-4), 135-152, 2000 | 157 | 2000 |

A point-placement strategy for conforming Delaunay tetrahedralization M Murphy, DM Mount, CW Gable International Journal of Computational Geometry & Applications 11 (06), 669-682, 2001 | 149 | 2001 |

Analysis of approximate nearest neighbor searching with clustered point sets S Maneewongvatana, DM Mount arXiv preprint cs/9901013, 1999 | 143 | 1999 |

Data structures and algorithms in C++ MT Goodrich, R Tamassia, DM Mount John Wiley & Sons, 2011 | 142 | 2011 |

Randomized and deterministic algorithms for geometric spanners of small diameter S Arya, DM Mount, M Smid Proceedings 35th Annual Symposium on Foundations of Computer Science, 703-712, 1994 | 110 | 1994 |