- Space-Efficient Approximate Voronoi Diagrams Department of Computer
- Efficient Randomized Algorithms for Robust Estimation of
- International Journal of Computational Geometry &c Applications
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- Author's personal copy Computational Geometry 43 (2010) 434444
- Space-Time Tradeoffs for Approximate Nearest Neighbor Hong Kong University of Science and Technology, Kowloon, Hong Kong, China
- Discrete Comput Geom (2009) 41: 398443 DOI 10.1007/s00454-009-9140-z
- Space-Time Tradeoffs for Approximate Spherical Range Counting Theocharis Malamatos
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
- An Empirical Study of a New Approach to Nearest Neighbor Searching
- Approximate Nearest Neighbor Queries in Fixed Dimensions David M. Mount
- A Simple Entropy-Based Algorithm for Planar Point Location
- SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 37, No. 2, pp. 584610
- Interpolation over Light Fields with Applications in Computer Graphics
- Binary Space Parititions in Plucker Space David M. Mount1
- On the Least Trimmed Squares Estimator David M. Mount
- Computational Statistics & Data Analysis 51 (2007) 24612486 www.elsevier.com/locate/csda
- Improved Approximation Bounds for Planar Point Pattern Matching
- Analyzing the Number of Samples Required for an Approximate Monte-Carlo LMS Line
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Algorithms for Facility Location Problems with Outliers (Extended Abstract)
- Computing Nearest Neighbors for Moving Points and Applications to Tapas Kanungo
- Compressing Kinetic Data from Sensor Networks
- Ray Interpolants for Fast Ray Tracing of Reflective and Refractive Objects F. Betul Atalay
- A Point-Placement Strategy for Conforming Delaunay Tetrahedralization
- 38 GEOMETRIC INTERSECTION David M. Mount
- IJCGA, 17(1), 2007, 71-103, c World Scientific Publishing Company International Journal of Computational Geometry & Applications
- A Dynamic Data Structure for Approximate Range Searching
- Tradeoffs in Approximate Range Searching Made Simpler Sunil Arya
- Nearly Optimal Expected-Case Planar Point Location Theocharis Malamatos
- Binary Space Parititions in Plucker Space David M. Mount1
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
- New Approaches to Robust, Point-Based Image Registration
- Computational Geometry: Proximity and Location
- Point Probe Decision Trees for Geometric Concept Classes \Lambda
- Euclidean Spanners: Short, Thin, and Lanky Sunil Arya \Lambda Gautam Das y David M. Mount z Jeffrey S. Salowe x Michiel Smid \Lambda
- The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
- Accounting for Boundary Effects in Nearest Neighbor David M. Mount
- Approximate Range Searching Department of Computer Science
- On the Area of Overlap of Translated Polygons \Lambda David M. Mount
- Embedding and Similarity Search for Point Sets under Translation
- A Unified Approach to Approximate Proximity Sunil Arya1,
- Maintaining Nets and Net Trees under Incremental Motion
- Entropy-Preserving Cuttings and Space-Efficient Planar Point Location
- An Efficient k-Means Clustering Algorithm: Analysis and Implementation
- Approximating Large Convolutions in Digital Images
- It's okay to be skinny, if your friends are fat Songrit Maneewongvatana and David M. Mount
- International Journal of Computational Geometry & Applications c World Scientific Publishing Company
- Pattern Recognition 32 (1999) 17--38 Efficient algorithms for robust feature matching
- Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
- Efficient Randomized Algorithms for the Repeated Median Line Estimator \Lambda
- On the Least Median Square Problem Jeff Erickson
- Stabbing Orthogonal Objects in 3Space David M. Mount
- A Computational Framework for Incremental Motion David M. Mount
- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
- Chromatic Nearest Neighbor Searching: A Query Sensitive Approach
- International Journal of Computational Geometry & Applications c World Scientific Publishing Company
- Randomized and deterministic algorithms for geometric spanners of small diameter
- On the Importance of Idempotence Department of Computer
- Polytope Approximation and the Mahler Volume Department of Computer Science and Engineering
