World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
41
Citations
20898
World Ranking
8565
National Ranking
3661

Mathematics

D-Index
41
Citations
20844
World Ranking
1840
National Ranking
780

Overview

David M. Mount is affiliated with the University of Maryland, College Park in the United States. Their research spans a range of topics within computer science and mathematics, with a focus on computational geometry and related areas.

Their work primarily covers these main fields of study:

  • Computer Science
  • Mathematics

Within these fields, more specialized subfields include:

  • Artificial Intelligence
  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Applied Mathematics

David M. Mount's research topics include:

  • Computational Geometry and Mesh Generation
  • Data Management and Algorithms
  • Point processes and geometric inequalities
  • Optimization and Search Problems
  • Machine Learning and Algorithms
  • Advanced Image and Video Retrieval Techniques
  • Machine Learning and Data Classification

Frequent collaborators in their work include:

  • Auguste H. Gezalyan
  • Guilherme D. da Fonseca
  • Ahmed Abdelkader
  • Sunil Arya
  • Alejandro Flores-Velazco

Their publications appear in both journals and preprint repositories. Most frequent publication venues are:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SSRN Electronic Journal
  • IEEE Transactions on Knowledge and Data Engineering
  • ACM Transactions on Algorithms

Recent papers authored by David M. Mount include:

  • On Efficient Shortest Path Computation on Terrain Surface: A Direction-Oriented Approach, 2024, IEEE Transactions on Knowledge and Data Engineering
  • Optimal Bound on the Combinatorial Complexity of Approximating Polytopes, 2022, ACM Transactions on Algorithms
  • Proximity Queries on Terrain Surface, 2022, ACM Transactions on Database Systems
  • Guarantees on nearest-neighbor condensation heuristics, 2020, Computational Geometry
  • Economical Convex Coverings and Applications, 2024, SIAM Journal on Computing

Best Publications

  • An efficient k-means clustering algorithm: analysis and implementation

    T. Kanungo;D.M. Mount;N.S. Netanyahu;C.D. Piatko

  • An optimal algorithm for approximate nearest neighbor searching fixed dimensions

    Sunil Arya;David M. Mount;Nathan S. Netanyahu;Ruth Silverman

  • An optimal algorithm for approximate nearest neighbor searching

    Sunil Arya;David M. Mount;Nathan S. Netanyahu;Ruth Silverman

  • The discrete geodesic problem

    Joseph S. B. Mitchell;David M. Mount;Christos H. Papadimitriou

  • A local search approximation algorithm for k-means clustering

    Tapas Kanungo;David M. Mount;Nathan S. Netanyahu;Christine D. Piatko

  • Approximate nearest neighbor queries in fixed dimensions

    Sunil Arya;David M. Mount

  • ANN: library for approximate nearest neighbor searching

    Sunil Arya;DM Mount

  • Algorithms for facility location problems with outliers

    Moses Charikar;Samir Khuller;David M. Mount;Giri Narasimhan

  • An output-sensitive algorithm for computing visibility

    Subir Kumar Ghosh;David M. Mount

  • A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM

    Nargess Memarsadeghi;Nargess Memarsadeghi;David M. Mount;Nathan S. Netanyahu;Nathan S. Netanyahu;Jacqueline Le Moigne

  • Euclidean spanners: short, thin, and lanky

    Sunil Arya;Gautam Das;David M. Mount;Jeffrey S. Salowe

  • Isomorphism of graphs with bounded eigenvalue multiplicity

    László Babai;D. Yu. Grigoryev;David M. Mount

  • Algorithms for fast vector quantization

    S. Arya;D.M. Mount

  • Space-time tradeoffs for approximate nearest neighbor searching

    Sunil Arya;Theocharis Malamatos;David M. Mount

  • Efficient algorithms for robust feature matching

    David M Mount;Nathan S Netanyahu;Jacqueline Le Moigne

  • The analysis of a simple k-means clustering algorithm

    Tapas Kanungo;David M. Mount;Nathan S. Netanyahu;Christine Piatko

  • Approximate range searching

    Sunil Arya;David M. Mount

  • A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION

    Michael Murphy;David M. Mount;Carl W. Gable

  • An output sensitive algorithm for computing visibility graphs

    Subir Kumar Ghosh;David M. Mount

  • Randomized and deterministic algorithms for geometric spanners of small diameter

    S. Arya;D.M. Mount;M. Smid

  • Analysis of Approximate Nearest Neighbor Searching with Clustered Point Sets

    Songrit Maneewongvatana;David M. Mount

Frequent Co-Authors

Longin Jan Latecki
Longin Jan Latecki Temple University
Sariel Har-Peled
Sariel Har-Peled University of Illinois at Urbana-Champaign
Joseph S. B. Mitchell
Joseph S. B. Mitchell Stony Brook University
Michiel Smid
Michiel Smid Carleton University
Clifford Stein
Clifford Stein Columbia University
Jeff Erickson
Jeff Erickson University of Illinois at Urbana-Champaign
Michael T. Goodrich
Michael T. Goodrich University of California, Irvine
Subhash Suri
Subhash Suri University of California, Santa Barbara
Esther M. Arkin
Esther M. Arkin Stony Brook University
Siu-Wing Cheng
Siu-Wing Cheng Hong Kong University of Science and Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to various related fields that enhance both analytical skills and career prospects. For those interested in applying mathematical knowledge to big data, pursuing a masters data analytics degree is a popular choice. This specialization combines statistical methods with computer science to solve real-world problems across industries.

For students looking to complement their quantitative skills with business acumen, online MBA programs provide flexible options. Identifying the easiest mba to get into can help reduce barriers to entry while delivering essential leadership training.

Many professionals prefer the convenience of an easy online mba to balance education with work commitments. These programs often offer accelerated paths to boost advancement opportunities without compromising quality.

For those aiming at higher-level administrative roles, an online Doctor of Business Administration (DBA) is valuable. The dba online programs provide cost-effective routes to gain expertise in strategy, leadership, and research, perfectly complementing a mathematics background.

Best Scientists Citing David M. Mount

Trending Scientists

Recently Published Articles