David M. Mount

According to our database1, David M. Mount authored at least 128 papers between 1982 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Coresets for the Nearest-Neighbor Rule.
CoRR, 2020

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions.
Comput. Geom., 2019

Modular Circulation and Applications to Traffic Management.
Algorithmica, 2019

Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Online Algorithms for Warehouse Management.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Guarantees on Nearest-Neighbor Condensation heuristics.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

New Directions in Approximate Nearest-Neighbor Searching.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Approximate Polytope Membership Queries.
SIAM J. Comput., 2018

Economical Delone Sets for Approximating Convex Bodies.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
On the Combinatorial Complexity of Approximating Polytopes.
Discret. Comput. Geom., 2017

Near-Optimal ε-Kernel Construction and Related Problems.
CoRR, 2017

Optimal Approximate Polytope Membership.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Distance Oracle on Terrain Surface.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Near-Optimal epsilon-Kernel Construction and Related Problems.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Space Exploration via Proximity Search.
Discret. Comput. Geom., 2016

A practical approximation algorithm for the LTS estimator.
Comput. Stat. Data Anal., 2016

A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
A sensor-based framework for kinetic data compression.
Comput. Geom., 2015

On the Complexity of an Unregulated Traffic Crossing.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximate Geometric MST Range Queries.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
On the Least Trimmed Squares Estimator.
Algorithmica, 2014

A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Output-sensitive well-separated pair decompositions for dynamic point sets.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012
Tight Lower Bounds for Halfspace Range Searching.
Discret. Comput. Geom., 2012

Optimal uniformly monotone partitioning of polygons with holes.
Comput. Aided Des., 2012

Polytope approximation and the Mahler volume.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A Self-adjusting Data Structure for Multidimensional Point Sets.
Proceedings of the Algorithms - ESA 2012, 2012

Optimal area-sensitive bounds for polytope approximation.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
New approaches to robust, point-based image registration.
Proceedings of the Image Registration for Remote Sensing, 2011

2010
Approximation algorithm for the kinetic robust K-center problem.
Comput. Geom., 2010

Approximate range searching: The absolute model.
Comput. Geom., 2010

Spatio-temporal Range Searching over Compressed Kinetic Sensor Data.
Proceedings of the Algorithms, 2010

A Unified Approach to Approximate Proximity Searching.
Proceedings of the Algorithms, 2010

A dynamic data structure for approximate range searching.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Space-time tradeoffs for approximate nearest neighbor searching.
J. ACM, 2009

The Effect of Corners on the Complexity of Approximate Range Searching.
Discret. Comput. Geom., 2009

Maintaining Nets and Net Trees under Incremental Motion.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Compressing Kinetic Data from Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Improved Approximation Bounds for Planar Point Pattern Matching.
Algorithmica, 2008

Tradeoffs in Approximate Range Searching Made Simpler.
Proceedings of the SIBGRAPI 2008, 2008

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.
Proceedings of the Algorithms, 2008

Embedding and similarity search for point sets under translation.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
A simple entropy-based algorithm for planar point location.
ACM Trans. Algorithms, 2007

Optimal Expected-Case Planar Point Location.
SIAM J. Comput., 2007

A Fast Implementation of the Isodata Clustering Algorithm.
Int. J. Comput. Geom. Appl., 2007

Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions.
Int. J. Comput. Geom. Appl., 2007

A practical approximation algorithm for the LMS line estimator.
Comput. Stat. Data Anal., 2007

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006
On the Least Median Square Problem.
Discret. Comput. Geom., 2006

Proximity problems on line segments spanned by points.
Comput. Geom., 2006

On the importance of idempotence.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

The Cost of Compatible Refinement of Simplex Decomposition Trees.
Proceedings of the 15th International Meshing Roundtable, 2006

Image Fusion Using Cokriging.
Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2006

Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Editorial.
Comput. Geom., 2005

Space-time tradeoffs for approximate spherical range counting.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Computational Geometry.
Proceedings of the Handbook of Data Structures and Applications., 2004

Geometric Intersection.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

A local search approximation algorithm for k-means clustering.
Comput. Geom., 2004

The ABCs of AVDs: Geometric Retrieval Made Simple.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

A computational framework for incremental motion.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Data structures and algorithms in C++.
Wiley, ISBN: 978-0-471-42924-1, 2004

2003
Interpolation over Light Fields with Applications in Computer Graphics.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
An Efficient k-Means Clustering Algorithm: Analysis and Implementation.
IEEE Trans. Pattern Anal. Mach. Intell., 2002

Algorithmic issues in modeling motion.
ACM Comput. Surv., 2002

Ray Interpolants for Fast Ray-Tracing Reflections and Refractions.
Proceedings of the 10-th International Conference in Central Europe on Computer Graphics, 2002

Space-efficient approximate Voronoi diagrams.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
Approximating large convolutions in digital images.
IEEE Trans. Image Process., 2001

A Point-Placement Strategy for Conforming Delaunay Tetrahedralization.
Int. J. Comput. Geom. Appl., 2001

Approximation Algorithm for Multiple-Tool Milling.
Int. J. Comput. Geom. Appl., 2001

Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses.
Comput. Geom., 2001

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Algorithms for facility location problems with outliers.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Entropy-preserving cuttings and space-efficient planar point location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions.
Proceedings of the Computational Science - ICCS 2001, 2001

An Empirical Study of a New Approach to Nearest Neighbor Searching.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems.
Int. J. Comput. Geom. Appl., 2000

Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time.
Int. J. Comput. Geom. Appl., 2000

Chromatic nearest neighbor searching: A query sensitive approach.
Comput. Geom., 2000

Approximate range searching.
Comput. Geom., 2000

Efficient Expected-Case Algorithms for Planar Point Location.
Proceedings of the Algorithm Theory, 2000

Nearly Optimal Expected-Case Planar Point Location.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

The analysis of a simple k-means clustering algorithm.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Efficient algorithms for robust feature matching.
Pattern Recognit., 1999

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions.
Comput. Geom., 1999

Computing Nearest Neighbors for Moving Points and Applications to Clustering.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Analysis of approximate nearest neighbor searching with clustered point sets.
Proceedings of the Data Structures, 1999

Binary Space Partitions in Plücker Space.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
J. ACM, 1998

Efficient Randomized Algorithms for the Repeated Median Line Estimator.
Algorithmica, 1998

Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Approximation Algorithms for Multiple-Tool Miling.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Quantile approximation for robust statistical estimation.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Parallelizing and Algorithm for Visibility on Polyhedral Terrain.
Int. J. Comput. Geom. Appl., 1997

Query-Sensitive Ray Shooting.
Int. J. Comput. Geom. Appl., 1997

Testing Simple Polygons.
Comput. Geom., 1997

1996
Accounting for Boundary Effects in Nearest-Neighbor Searching.
Discret. Comput. Geom., 1996

On the Area of Overlap of Translated Polygons.
Comput. Vis. Image Underst., 1996

1995
Euclidean spanners: short, thin, and lanky.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Computationally Efficient Algorithms for High-Dimensional Robust Estimators.
CVGIP Graph. Model. Image Process., 1994

An Optimal Algorithm for Approximate Nearest Neighbor Searching.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Randomized and deterministic algorithms for geometric spanners of small diameter
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Probabilistic analysis of some navigation strategies in a dynamic environment.
IEEE Trans. Syst. Man Cybern., 1993

Point Probe Decision Trees for Geometric Concept Classes.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Approximate Nearest Neighbor Queries in Fixed Dimensions.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Algorithms for Fast Vector Quantizaton.
Proceedings of the IEEE Data Compression Conference, 1993

Efficient Algorithms for Robust Circular Arc Estimators.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
A randomized algorithm for slope selection.
Int. J. Comput. Geom. Appl., 1992

A parallel algorithm for enclosed and enclosing triangles.
Int. J. Comput. Geom. Appl., 1992

Parallel Computational Geometry of Rectangles.
Algorithmica, 1992

Intersection Detection and Separators for Simple Polygons.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
An Output-Sensitive Algorithm for Computing Visibility Graphs.
SIAM J. Comput., 1991

Pyramid computation of neighbor distance statistics in dot patterns.
CVGIP Graph. Model. Image Process., 1991

1990
The Number of Shortest Paths on the Surface of a Polyhedron.
SIAM J. Comput., 1990

Packing and Covering the Plane with Translates of a Convex Polygon.
J. Algorithms, 1990

The Densest Double-Lattice Packing of a Convex Polygon.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

1988
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter.
SIAM J. Comput., 1988

Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
The Discrete Geodesic Problem.
SIAM J. Comput., 1987

Storing the Subdivision of a Polyhedral Surface.
Discret. Comput. Geom., 1987

The decomposition of a square into rectangles of minimal perimeter.
Discret. Appl. Math., 1987

Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results.
Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

1982
Isomorphism of Graphs with Bounded Eigenvalue Multiplicity
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982


  Loading...