David Mount

Q: What Schools Are Affiliated With David Mount

David Mount is affiliated with the following schools: University of Maryland, College Park, Stanford University, Purdue University

David Mount's AcademicInfluence.com Rankings

David Mount

Computer Science

#1807

World Rank

#1873

Historical Rank

#863

USA Rank

Database

#5691

World Rank

#5906

Historical Rank

#779

USA Rank

computer-science Degrees

Download Badge

Computer Science

David Mount's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics University of Maryland, College Park

Similar Degrees You Can Earn

Why Is David Mount Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David Mount is a professor at the University of Maryland, College Park department of computer science whose research is in computational geometry. Biography Mount received a B.S. in Computer Science at Purdue University in 1977 and received his Ph.D. in Computer Science at Purdue University in 1983 under the advisement of Christoph Hoffmann.

(See a Problem?)

David Mount's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An Efficient k-Means Clustering Algorithm: Analysis and Implementation (2002) (5148)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions (1994) (2805)
The Discrete Geodesic Problem (1987) (706)
A local search approximation algorithm for k-means clustering (2002) (650)
ANN: library for approximate nearest neighbor searching (1998) (537)
Approximate nearest neighbor queries in fixed dimensions (1993) (422)
Algorithms for facility location problems with outliers (2001) (404)
An output sensitive algorithm for computing visibility graphs (1987) (351)
Space-time tradeoffs for approximate nearest neighbor searching (2009) (228)
Euclidean spanners: short, thin, and lanky (1995) (206)
A Fast Implementation of the Isodata Clustering Algorithm (2007) (187)
Isomorphism of graphs with bounded eigenvalue multiplicity (1982) (186)
Algorithms for fast vector quantization (1993) (181)
Efficient algorithms for robust feature matching (1999) (180)
Approximate range searching (1995) (179)
The analysis of a simple k-means clustering algorithm (2000) (138)
A point-placement strategy for conforming Delaunay tetrahedralization (2000) (115)
It's okay to be skinny, if your friends are fat (1999) (102)
Analysis of approximate nearest neighbor searching with clustered point sets (1999) (93)
Data structures and algorithms in C++ (2003) (82)
Randomized and deterministic algorithms for geometric spanners of small diameter (1994) (80)
On Finding Shortest Paths on Convex Polyhedra. (1985) (79)
Algorithmic issues in modeling motion (2002) (72)
ANN Programming Manual (1998) (70)
Space-efficient approximate Voronoi diagrams (2002) (68)
Methods for Aquatic Toxicity Identification Evaluations Phase Ill Toxicity Confirmation Procedures for Samples Exhibiting Acute and Chronic Toxicity c (1993) (66)
Query-sensitive ray shooting (1994) (65)
On the Least Trimmed Squares Estimator (2014) (64)
Accounting for boundary effects in nearest neighbor searching (1995) (63)
On the Area of Overlap of Translated Polygons (1996) (56)
A randomized algorithm for slope selection (1992) (54)
A practical approximation algorithm for the LMS line estimator (1997) (53)
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1999) (49)
A simple entropy-based algorithm for planar point location (2001) (48)
Algorithm Engineering and Experiments (2002) (46)
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions (2001) (46)
Voronoi Diagrams on the Surface of a Polyhedron. (1985) (41)
On the Least Median Square Problem (2004) (38)
Approximation Algorithm for Multiple-Tool Milling (2001) (37)
Efficient Randomized Algorithms for the Repeated Median Line Estimator (1998) (36)
Improved algorithms for robust point pattern matching and applications to image registration (1998) (36)
Intersection detection and separators for simple polygons (1992) (35)
Geometric Intersection (2004) (35)
Accounting for boundary effects in nearest-neighbor searching (1996) (33)
A parallel algorithm for enclosed and enclosing triangles (1991) (32)
The Number of Shortest Paths on the Surface of a Polyhedron (1990) (30)
A new approach to image fusion based on cokriging (2005) (30)
Optimal Expected-Case Planar Point Location (2007) (29)
Space-time tradeoffs for approximate spherical range counting (2005) (29)
Packing and Covering the Plane with Translates of a Convex Polygon (1990) (29)
Entropy-preserving cuttings and space-efficient planar point location (2001) (29)
Optimal Approximate Polytope Membership (2016) (26)
Computing nearest neighbors for moving points and applications to clustering (1999) (24)
Dynamic maintenance of Delaunay triangulations (1991) (24)
Storing the subdivision of a polyhedral surface (1986) (24)
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (2001) (23)
Globally-Equiangular triangulations of co-circular points in 0(n log n) time (1988) (23)
Efficient Kriging via Fast Matrix-Vector Products (2008) (22)
On the Combinatorial Complexity of Approximating Polytopes (2016) (22)
Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions (2007) (22)
Tight Lower Bounds for Halfspace Range Searching (2010) (22)
Geo-registration of Landsat data by robust matching of wavelet features (2000) (21)
The effect of corners on the complexity of approximate range searching (2006) (21)
Approximate polytope membership queries (2016) (20)
The Densest Double-Lattice Packing of a Convex Polygon (1991) (20)
Ecient Algorithms for Robust Feature Matching (1998) (20)
Efficient Expected-Case Algorithms for Planar Point Location (2000) (20)
KMlocal : A Testbed for k-means Clustering Algorithms (20)
Optimal area-sensitive bounds for polytope approximation (2012) (19)
Approximation algorithm for the kinetic robust K-center problem (2010) (19)
On the importance of idempotence (2006) (18)
Nearly optimal expected-case planar point location (2000) (18)
Image Fusion Using Cokriging (2006) (18)
Polytope approximation and the Mahler volume (2012) (17)
A computational framework for incremental motion (2004) (17)
The decomposition of a square into rectangles of minimal perimeter (1987) (17)
A dynamic data structure for approximate range searching (2010) (17)
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter (1988) (16)
Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems (2000) (16)
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees (2016) (16)
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching (2001) (16)
Chromatic nearest neighbor searching: A query sensitive approach (2000) (16)
A Unified Approach to Approximate Proximity Searching (2010) (15)
Improved Approximation Bounds for Planar Point Pattern Matching (2005) (14)
Probabilistic analysis of some navigation strategies in a dynamic environment (1993) (13)
Point Probe Decision Trees for Geometric Concept Classes (1993) (13)
Robust matching of wavelet features for sub-pixel registration of Landsat data (2001) (12)
Near-Optimal ε-Kernel Construction and Related Problems (2017) (12)
Proximity Problems on Line Segments Spanned by Points (2006) (11)
Near-Optimal epsilon-Kernel Construction and Related Problems (2017) (11)
Testing Simple Polygons (1997) (10)
Maintaining Nets and Net Trees under Incremental Motion (2009) (10)
Parallelizing and Algorithm for Visibility on Polyhedral Terrain (1997) (10)
On the Complexity of an Unregulated Traffic Crossing (2015) (10)
Parallel computational geometry of rectangles (1992) (9)
Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data (2006) (9)
A Self-adjusting Data Structure for Multidimensional Point Sets (2012) (9)
An Empirical Study of a New Approach to Nearest Neighbor Searching (2001) (9)
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets (2007) (9)
Computationally Efficient Algorithms for High-Dimensional Robust Estimators (1994) (8)
Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time (2000) (8)
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (2008) (7)
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances (2019) (7)
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums (2018) (7)
Optimal uniformly monotone partitioning of polygons with holes (2012) (7)
Tradeoffs in Approximate Range Searching Made Simpler (2008) (7)
Navigation in a hazardous environment with distributed shelters (1991) (7)
A practical approximation algorithm for the LTS estimator (2016) (7)
Merging in parallel computational geometry (1989) (7)
The Cost of Compatible Refinement of Simplex Decomposition Trees (2006) (7)
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (2019) (7)
Economical Delone Sets for Approximating Convex Bodies (2018) (6)
A fast implementation of the ISOCLUS algorithm (2003) (6)
Approximate Geometric MST Range Queries (2015) (6)
Ray Interpolants for Fast Ray-Tracing Reflections and Refractions (2002) (5)
A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets (2014) (5)
Approximation algorithms for multiple-tool miling (1998) (5)
New approaches to robust, point-based image registration (2011) (5)
On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions (1993) (5)
Output-sensitive well-separated pair decompositions for dynamic point sets (2013) (5)
Guarantees on Nearest-Neighbor Condensation heuristics (2019) (5)
Binary Space Partitions in Plücker Space (1999) (5)
The Effect of Corners on the Complexity of Approximate Range Searching (2009) (5)
Approximate polytope membership queries (2011) (5)
CMSC 754 Computational Geometry 1 (2005) (5)
Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching (2006) (5)
Approximating large convolutions in digital images (1998) (4)
An Energy-Saving Routing Algorithm for Wireless Body Sensor Network using Data Compression Technique (2017) (4)
Eƒcient algorithms for robust feature matching1 (1999) (4)
Space Exploration via Proximity Search (2014) (4)
Compressing Kinetic Data from Sensor Networks (2009) (4)
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data (2010) (4)
Delaunay triangulation and computational fluid dynamics meshes (1992) (4)
Minimum enclosures with specified angles (1993) (4)
Distance Oracle on Terrain Surface (2017) (3)
Approximate range searching in the absolute error model (2007) (3)
Web Log Mining using K-Apriori Algorithm (2012) (3)
Data structures for global illumination computation and visibility queries in 3-space (1998) (3)
A Game-Theoretic Approach for Minimizing Delays in Autonomous Intersections (2017) (3)
Computational Geometry: Proximity and Location (2018) (3)
Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments (2002) (2)
Coresets for the Nearest-Neighbor Rule (2020) (2)
Space Exploration via Proximity Search (2016) (2)
Efficient Algorithms for Robust Circular Arc Estimators (1993) (2)
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions (2019) (2)
Analyzing the Number of Samples Required for an Approximate Monte-Carlo LMS Line Estimator (2004) (2)
Pyramid computation of neighbor distance statistics in dot patterns (1991) (2)
Interpolation over Light Fields with Applications in Computer Graphics (2003) (2)
New Directions in Approximate Nearest-Neighbor Searching (2019) (2)
Data Structures and Algorithms in C++, 2/E (2016) (1)
Voronoi Diagrams in the Hilbert Metric (2021) (1)
Lecture 10 : Voronoi Diagrams and Fortune ’ s Algorithm (2013) (1)
On the Least Trimmed Squares Estimator (2012) (1)
Hierarchical Simplicial Meshes and Multidimensional Interpolation (1)
Economical Convex Coverings and Applications (2023) (1)
Area of overlap of translated polygons (1993) (1)
Realistic Compression of Kinetic Sensor Data (2010) (1)
CMSC 451 : Design and Analysis of Computer Algorithms Fall (2004) (1)
Multi-dimensional nearest neighbor searching with low-dimensional data (2001) (1)
Acknowledgments Discussions With (1996) (1)
Stabbing Orthogonal Objects in 3-Space (1998) (1)
Partitioning planar graphs with costs and weights (2002) (1)
On the Combinatorial Complexity of Approximating Polytopes (2017) (0)
Quantile approximation for robust statistical estimation (1998) (0)
Extended and Scapegoat Trees (2019) (0)
Hashing-Handling Collisions Hashing (2019) (0)
A sensor-based framework for kinetic data compression (2015) (0)
Nearest Neighbor Condensation with Guarantees (2018) (0)
Tight Lower Bounds for Halfspace Range Searching (2012) (0)
Planar Point Location (using Trapezoidal Maps) (2021) (0)
Orthogonal Range Searching and kd-Trees (2021) (0)
Computing generalized Voronoi diagrams in improved time and space bounds (1991) (0)
Online Algorithms for Warehouse Management (2019) (0)
Modular Circulation and Applications to Traffic Management (2017) (0)
Cmsc 425: Lecture 8 Geometric Data Structures: Enclosures and Indices (2016) (0)
Renaissance Love Sonnets for Close-Reading Practice (2017) (0)
186-193 Image Rectification Based on Minimal Epipolar Distortion ∗ (2007) (0)
Convex Hulls: Lower Bounds and Output Sensitivity (2020) (0)
Front Matter: Volume 6499 (2007) (0)
Ray Interpolants for Fast Ray Tracing of Reflective and Refractive Objects (0)
Delaunay Triangulations: General Properties (2021) (0)
Algorithm engineering and experiments : 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002 : revised papers (2002) (0)
Vision geometry VIII : 19-20 July 1999, Denver, Colorado (1999) (0)
Vision geometry X : 29-30 July 2001, San Diego, USA (2001) (0)
Optimally Confining Lattice Polymers (2022) (0)
Vision Geometry XII (2004) (0)
Trapezoidal Maps and Planar Point Location (2020) (0)
Proximity Searching and the Quest for the Holy Grail (2012) (0)
Delaunay triangulations and control-volume mesh generation (2002) (0)
CMSC 451 Dave Mount CMSC 451 : Lecture 2 Background : Graphs Thursday , Aug 31 , 2017 (2017) (0)
Proximity Queries on Terrain Surface (2022) (0)
Polytope Approximation and the Mahler Volume (Preprint) (2012) (0)
Alenex workshop preface (2005) (0)
Convex Hulls in the Plane (2020) (0)
Data Structures for Dynamic and Kinetic Multidimensional Point Sets (2008) (0)
CMSC 451 Dave Mount CMSC 451 : Lecture 6 Greedy Algorithms : Huffman Coding Thursday , Sep 14 , 2017 (2017) (0)
Arithmetic Characterization of Polynomial based Discrete Curves (2018) (0)
Optimal Volume-Sensitive Bounds for Polytope Approximation (2023) (0)
Network Flow : Extensions Thursday , Nov 9 , 2017 (2017) (0)
? ? ? ? 57 ? ? ? ? ? ? ? ? 44 ? ? ? ? (2019) (0)
CMSC 451 Dave Mount CMSC 451 : Lecture 17 Extensions of Network Flow (2017) (0)
An Enhanced Image Retrieval using Contribution-based Clustering Algorithm with Spatial Feature of Texture Primitive and Edge Detection (2015) (0)
Vai89] P. M. Vaidya. a New Algorithm for Minimizing Convex Functions over Convex Sets. in 5 Concluding Remarks Acknowledgements. I'm Grateful to 4.3 Solving Closest-point Problems 4.1 Finding L S 4 Closest-point Queries (1993) (0)
Spatial Layout Image Retrieval based on Fast Image Segmentation using K-Means Clustering (2021) (0)
Simple polygon A triangulation Dual graph (2020) (0)
Solid Modeling and Mesh Representation (2018) (0)
Cmsc 425: Lecture 7 Geometric Programming: Sample Solutions (2016) (0)
Vision Geometry XV (2007) (0)
Trees Balanced Binary Trees (2020) (0)
CMSC 451 : Lecture 21 Clique , Vertex Cover , and Dominating Set Thursday , Nov 30 , 2017 (2017) (0)
Vision geometry IX : 30-31 July 2000, San Diego, USA (2000) (0)
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching (2022) (0)
21 NP-Completeness : Clique , Vertex Cover , and Dominating Set Thursday , Nov 30 , 2017 (2017) (0)
Revealing New Perspectives : Retrieving the Details of High Dynamic Range Images on Low Dynamic Range Displays through Tone Mapping (2005) (0)
Embedding and similarity search for point sets under translation (2008) (0)
Vision geometry XI : 7-8 July 2002, Seattle, Washington, USA (2002) (0)
More on Geometry and Geometric Programming (2018) (0)
Voronoi Diagrams and Fortune’s Algorithm (2020) (0)
Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice (2006) (0)
Approximate Nearest-Neighbor Search for Line Segments (2021) (0)
Stabbing Orthogonal Objects in 3 - (2007) (0)
All-Pairs Shortest Paths and the Floyd-Warshall Algorithm (2017) (0)
Using Hierarchical Simplicial Meshes to Render Atmospheric Effects (2004) (0)
Trapezoidal Maps (2012) (0)
Modular Circulation and Applications to Traffic Management (2018) (0)
CMSC 451 Dave Mount CMSC 451 : Lecture 19 NP-Completeness : Reductions Tue , Nov 21 , 2017 (2017) (0)
Halfplane Intersection and Point-Line Duality (2020) (0)
ANewApproach toImageFusion Based onCokriging (2005) (0)
Optimally Tracking Labels on an Evolving Tree (2022) (0)
A PTAS for the Min-Max Euclidean Multiple TSP (2021) (0)
On Proximity Searching in Euclidean and Other Metric Spaces (2009) (0)
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric (2023) (0)
The ABCs of AVDs: Geometric Retrieval Made Simple (2004) (0)
for Computing v"isibility Graphs (1987) (0)
Geometric Programming : Sample Solutions Samples (2018) (0)
CMSC 420 : Lecture 3 Rooted Trees and Binary Trees (2019) (0)
Computational Geometry (2004) (0)
Rooted Trees and Binary Trees (2020) (0)
Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results (1987) (0)
Enhancements in robust feature matching (2008) (0)
Tight Lower Bounds for Halfspace Range Searching (Extended Abstract) (2010) (0)

This paper list is powered by the following services:

Other Resources About David Mount

What Schools Are Affiliated With David Mount?

David Mount is affiliated with the following schools:

David Mount's Academic­Influence.com Rankings