David M. Mount

From MaRDI portal
Person:202647

Available identifiers

zbMath Open mount.david-mWikidataQ5237772 ScholiaQ5237772MaRDI QIDQ202647

List of research outcomes

PublicationDate of PublicationType
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes2023-10-31Paper
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification.2023-09-20Paper
Coresets for the Nearest-Neighbor Rule2023-02-07Paper
Online Algorithms for Warehouse Management.2023-02-03Paper
Point probe decision trees for geometric concept classes2023-01-18Paper
Voronoi Diagrams in the Hilbert Metric2021-12-06Paper
Guarantees on nearest-neighbor condensation heuristics2021-09-16Paper
https://portal.mardi4nfdi.de/entity/Q50095602021-08-04Paper
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes2021-02-02Paper
Economical Delone Sets for Approximating Convex Bodies2020-08-25Paper
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances2019-10-15Paper
New directions in approximate nearest-neighbor searching2019-10-10Paper
Modular circulation and applications to traffic management2019-09-10Paper
https://portal.mardi4nfdi.de/entity/Q57433752019-05-10Paper
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions2019-03-20Paper
A local search approximation algorithm for k-means clustering2018-11-23Paper
A practical approximation algorithm for the LTS estimator2018-08-15Paper
https://portal.mardi4nfdi.de/entity/Q45800822018-08-13Paper
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees2018-07-16Paper
Optimal Approximate Polytope Membership2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46438962018-05-29Paper
https://portal.mardi4nfdi.de/entity/Q31328442018-01-30Paper
Approximate Polytope Membership Queries2018-01-12Paper
On the combinatorial complexity of approximating polytopes2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q53687002017-10-10Paper
Approximate geometric MST range queries2017-10-10Paper
The analysis of a simple k -means clustering algorithm2017-09-29Paper
A computational framework for incremental motion2017-09-29Paper
On the least median square problem2017-09-29Paper
Modular circulation and applications to traffic management2017-09-22Paper
Space exploration via proximity search2016-09-14Paper
On the Complexity of an Unregulated Traffic Crossing2015-10-30Paper
A simple entropy-based algorithm for planar point location2015-09-02Paper
https://portal.mardi4nfdi.de/entity/Q55018252015-08-14Paper
A sensor-based framework for kinetic data compression2014-12-23Paper
On the importance of idempotence2014-11-25Paper
On the least trimmed squares estimator2014-11-19Paper
https://portal.mardi4nfdi.de/entity/Q29217102014-10-13Paper
Optimal area-sensitive bounds for polytope approximation2014-08-07Paper
Approximate polytope membership queries2014-06-05Paper
Tight lower bounds for halfspace range searching2014-04-03Paper
A dynamic data structure for approximate range searching2014-04-03Paper
A Self-adjusting Data Structure for Multidimensional Point Sets2012-09-25Paper
Tight lower bounds for halfspace range searching2012-05-22Paper
A Unified Approach to Approximate Proximity Searching2010-09-06Paper
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data2010-09-06Paper
Space-efficient approximate Voronoi diagrams2010-08-05Paper
Approximation algorithm for the kinetic robust \(k\)-center problem2010-07-28Paper
Space-time tradeoffs for approximate nearest neighbor searching2010-07-14Paper
Approximate range searching: The absolute model2010-03-16Paper
Maintaining Nets and Net Trees under Incremental Motion2009-12-17Paper
A practical approximation algorithm for the LMS line estimator2009-05-29Paper
The effect of corners on the complexity of approximate range searching2009-04-27Paper
Embedding and similarity search for point sets under translation2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015162009-02-10Paper
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces2008-11-25Paper
POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS2008-05-20Paper
Testing simple polygons.2008-04-25Paper
Optimal Expected-Case Planar Point Location2008-04-22Paper
Improved approximation bounds for planar point pattern matching2008-04-03Paper
A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM2007-03-21Paper
On the least median square problem2006-12-06Paper
Algorithms and Data Structures2006-10-25Paper
Proximity problems on line segments spanned by points2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q52903042006-04-28Paper
Algorithms and Computation2005-12-22Paper
APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING2005-06-10Paper
An optimal algorithm for approximate nearest neighbor searching fixed dimensions2005-01-25Paper
A local search approximation algorithm for \(k\)-means clustering2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44602722004-05-18Paper
Approximating large convolutions in digital images2003-10-15Paper
https://portal.mardi4nfdi.de/entity/Q48011902003-04-07Paper
https://portal.mardi4nfdi.de/entity/Q47785622002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q27683042002-06-18Paper
https://portal.mardi4nfdi.de/entity/Q27794012002-04-15Paper
https://portal.mardi4nfdi.de/entity/Q27683032002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q27683592002-01-30Paper
Approximate range searching2001-09-13Paper
VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME2001-09-13Paper
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses2001-09-09Paper
https://portal.mardi4nfdi.de/entity/Q42340972001-08-28Paper
https://portal.mardi4nfdi.de/entity/Q27219942001-07-11Paper
QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS2001-07-05Paper
Chromatic nearest neighbor searching: A query sensitive approach2001-06-21Paper
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions2000-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42252441999-01-18Paper
https://portal.mardi4nfdi.de/entity/Q42524161999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44010231998-08-02Paper
Efficient randomized algorithms for the repeated median line estimator1998-05-24Paper
Parallelizing an Algorithm for Visibility on Polyhedral Terrain1997-07-27Paper
https://portal.mardi4nfdi.de/entity/Q31289201997-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48396191995-08-30Paper
https://portal.mardi4nfdi.de/entity/Q43024641994-09-13Paper
Pyramid computation of neighbor distance statistics in dot patterns1994-08-29Paper
https://portal.mardi4nfdi.de/entity/Q31404031993-12-21Paper
https://portal.mardi4nfdi.de/entity/Q31404291993-12-21Paper
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION1993-01-16Paper
A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40113211992-09-27Paper
Parallel computational geometry of rectangles1992-06-28Paper
An Output-Sensitive Algorithm for Computing Visibility Graphs1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33582661991-01-01Paper
Packing and covering the plane with translates of a convex polygon1990-01-01Paper
The Number of Shortest Paths on the Surface of a Polyhedron1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38295881989-01-01Paper
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter1988-01-01Paper
The decomposition of a square into rectangles of minimal perimeter1987-01-01Paper
Storing the subdivision of a polyhedral surface1987-01-01Paper
The Discrete Geodesic Problem1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: David M. Mount