The following pages link to David M. Mount (Q202647):
Displaying 50 items.
- (Q312148) (redirect page) (← links)
- Space exploration via proximity search (Q312150) (← links)
- (Q420570) (redirect page) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- (Q482330) (redirect page) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- (Q588506) (redirect page) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions (Q670709) (← links)
- On the least median square problem (Q854711) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- The decomposition of a square into rectangles of minimal perimeter (Q1082348) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- (Q1386371) (redirect page) (← links)
- Efficient randomized algorithms for the repeated median line estimator (Q1386373) (← links)
- Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
- Approximate range searching (Q1595401) (← links)
- A practical approximation algorithm for the LTS estimator (Q1659190) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (Q1807649) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- Guarantees on nearest-neighbor condensation heuristics (Q1984597) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- New directions in approximate nearest-neighbor searching (Q2326561) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Testing simple polygons. (Q2482903) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems (Q2708040) (← links)
- (Q2721994) (← links)
- Entropy-preserving cuttings and space-efficient planar point location (Q2768303) (← links)
- A simple entropy-based algorithm for planar point location (Q2768304) (← links)
- Algorithms for facility location problems with outliers. (Extended abstract) (Q2768359) (← links)
- (Q2779401) (← links)
- Optimal area-sensitive bounds for polytope approximation (Q2874597) (← links)
- A Self-adjusting Data Structure for Multidimensional Point Sets (Q2912893) (← links)
- Space-time tradeoffs for approximate spherical range counting (Q2921710) (← links)
- On the importance of idempotence (Q2931419) (← links)
- A simple entropy-based algorithm for planar point location (Q2944554) (← links)
- The Discrete Geodesic Problem (Q3028357) (← links)
- (Q3128920) (← links)
- On the combinatorial complexity of approximating polytopes (Q3132844) (← links)
- (Q3140403) (← links)
- (Q3140429) (← links)
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions (Q3158524) (← links)
- Packing and covering the plane with translates of a convex polygon (Q3201801) (← links)
- (Q3358266) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
