Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
An efficient k-means clustering algorithm: analysis and implementation
20023.9k citationsTapas Kanungo, David M. Mount et al.profile →
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
19981.5k citationsSunil Arya, David M. Mount et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by David M. Mount
Since
Specialization
Citations
This map shows the geographic impact of David M. Mount's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David M. Mount with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David M. Mount more than expected).
This network shows the impact of papers produced by David M. Mount. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David M. Mount. The network helps show where David M. Mount may publish in the future.
Co-authorship network of co-authors of David M. Mount
This figure shows the co-authorship network connecting the top 25 collaborators of David M. Mount.
A scholar is included among the top collaborators of David M. Mount based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with David M. Mount. David M. Mount is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Mount, David M., et al.. (2014). A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets.. Canadian Conference on Computational Geometry.4 indexed citations
Kanungo, Tapas, David M. Mount, Nathan S. Netanyahu, et al.. (1999). Computing nearest neighbors for moving points and applications to clustering. Symposium on Discrete Algorithms. 931–932.16 indexed citations
Dillencourt, Michael B., David M. Mount, & Alan Saalfeld. (1993). On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions.. Canadian Conference on Computational Geometry. XXVII(127). 49–54.1 indexed citations
Mount, David M. & Nathan S. Netanyahu. (1993). Efficient Algorithms for Robust Circular Arc Estimators.. Canadian Conference on Computational Geometry. 79–84.2 indexed citations
20.
Mount, David M., et al.. (1992). Delaunay triangulation and computational fluid dynamics meshes. NASA Technical Reports Server (NASA).2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.