Dave Mount
Professor
4246 Iribe Center
(301) 405-2704
(301) 405-6707
Education:
Ph.D. Purdue University (Computer Science)
Biography:
David Mount is a professor of computer science with an appointment in the University of Maryland Institute for Advanced Computer Studies.
His research in computational geometry focuses on designing, analyzing and implementing data structures and algorithms for geometric problems. Mount’s work has applications in image processing, pattern recognition, information retrieval, and computer graphics.
Go here to view Mount’s academic publications listed on Google Scholar.
Publications
2012
2012. Polytope approximation and the Mahler volume. Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. :29-42.
2011
2011. Approximate polytope membership queries. Proceedings of 43rd Annual ACM Symposium on Theory of Computing. :579-586.
2010
2010. Realistic Compression of Kinetic Sensor Data. CS-TR-4959
2010. Tight lower bounds for halfspace range searching. Proceedings of the 2010 annual symposium on Computational geometry. :29-37.
2010. A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
2010. A unified approach to approximate proximity searching. Algorithms–ESA 2010. :374-385.
2010. Spatio-temporal range searching over compressed kinetic sensor data. Algorithms–ESA 2010. :386-397.
2010. Approximate range searching: The absolute model. Computational Geometry. 43(4):434-444.
2010. New Approaches to Robust, Point-Based Image Registration. Image Registration for Remote SensingImage Registration for Remote Sensing.
2010. Approximation algorithm for the kinetic robust K-center problem. Computational Geometry. 43(6–7):572-586.
2009
2009. Space-time tradeoffs for approximate nearest neighbor searching. Journal of the ACM (JACM). 57(1):1:1–1:54-1:1–1:54.
2009. The effect of corners on the complexity of approximate range searching. Discrete & Computational Geometry. 41(3):398-443.
2009. Compressing kinetic data from sensor networks. Algorithmic Aspects of Wireless Sensor Networks. :191-202.
2009. Maintaining nets and net trees under incremental motion. Algorithms and Computation. :1134-1143.
2008
2008. Enhancements in robust feature matching. Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, 2008. ECTI-CON 2008. 5th International Conference on. 1:505-508.
2008. Efficient Kriging via Fast Matrix-Vector Products. Aerospace Conference, 2008 IEEE. :1-7.
2008. Space-time tradeoffs for proximity searching in doubling spaces. Algorithms-ESA 2008. :112-123.
2008. Tradeoffs in Approximate Range Searching Made Simpler. Computer Graphics and Image Processing, 2008. SIBGRAPI '08. XXI Brazilian Symposium on. :237-244.
2008. Efficient Kriging via Fast Matrix-Vector Products. Aerospace Conference, 2008 IEEE. :1-7.
2008. Improved approximation bounds for planar point pattern matching. Algorithmica. 50(2):175-207.
2008. Embedding and similarity search for point sets under translation. Proceedings of the twenty-fourth annual symposium on Computational geometry. :320-327.
2007
2007. Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions. International Journal of Computational Geometry and Applications. 17(6):595-631.
2007. Efficient implementation of an optimal interpolator for large spatial data sets. Computational Science–ICCS 2007. :503-510.
2007. Optimal expected-case planar point location. SIAM Journal on Computing. 37(2):584-584.
2007. A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
2007. A fast implementation of the ISODATA clustering algorithm. International Journal of Computational Geometry and Applications. 17(1):71-103.
2007. A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
2007. Vision Geometry XV. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 6499
2006
2006. The cost of compatible refinement of simplex decomposition trees. Proceedings of the 15th International Meshing Roundtable. :57-69.
2006. Image fusion using cokriging. Geosci. and Remote Sens. Symp., 2006. IGARSS 2006. IEEE Int. Conf. on. :2518-2521.
2006. Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data. Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on. 5:V-V.
2006. On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
2006. Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. Proceedings of the eighth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics. 123:65-65.
2006. Proximity problems on line segments spanned by points. Computational Geometry. 33(3):115-129.
2006. On the Least Median Square Problem. Discrete & Computational Geometry. 36(4):593-607.
2005
2005. The ABCs of AVDs: Geometric Retrieval Made Simple. Algorithms and Computation. :819-826.
2005. Using Iterative Strategies for Aligning Attributed Points in Space. ISR-TR-2005-2
2005. Improved approximation bounds for planar point pattern matching. Algorithms and Data Structures. :432-443.
2005. Space-time tradeoffs for approximate spherical range counting. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. :535-544.
2005. A new approach to image fusion based on cokriging. Information Fusion, 2005 8th International Conference on. 1:8pp.-8pp..
2005. Vision geometry XIII(San Jose CA, 18-19 January 2005). SPIE proceedings series.
2004
2004. Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator. Theory and Applications of Recent Robust MethodsTheory and Applications of Recent Robust Methods. :207-219.
2004. Vision Geometry XII. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 5300
2004. A computational framework for incremental motion. Proceedings of the twentieth annual symposium on Computational geometry. :200-209.
2004. Vision geometry XII:(San Jose CA, 19-20 January 2004). SPIE proceedings series.
2003
2003. A Fast Implementation of the ISOCLUS Algorithm. IEEE 2003 International Geoscience and Remote Sensing Symposium.
2003. Data Structures and Algorithms in C++. :714.
2003. Interpolation over light fields with applications in computer graphics. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments. :56-68.
2002
2002. Partitioning planar graphs with costs and weights. 4th International Workshop on Algorithm Engineering and Experiments. 2409:98-110.
2002. Algorithmic issues in modeling motion. ACM Comput. Surv.. 34(4):550-572.
2002. A local search approximation algorithm for k-means clustering. Proceedings of the eighteenth annual symposium on Computational geometry. :10-18.
2002. Analysis of approximate nearest neighbor searching with clustered point sets. Data Structures, Near Neighbor Searches, and MethodologyData Structures, Near Neighbor Searches, and Methodology. 59:105-123.
2002. Space-efficient approximate Voronoi diagrams. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. :721-730.
2002. Ray interpolants for fast raytracing reflections and refractions. Journal of WSCG (Proc. International Conf. in Central Europe on Comp. Graph., Visualization and Comp. Vision). 10(3):1-8.
2002. An efficient k-means clustering algorithm: analysis and implementation. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 24(7):881-892.
2002. Vision geometry XI(Seattle WA, 7-8 July 2002). SPIE proceedings series.
2001
2001. On the efficiency of nearest neighbor searching with data clustered in lower dimensions. Computational Science—ICCS 2001. :842-851.
2001. The analysis of a probabilistic approach to nearest neighbor searching. Algorithms and Data Structures. :276-286.
2001. Robust matching of wavelet features for sub-pixel registration of Landsat data. Geoscience and Remote Sensing Symposium, 2001. IGARSS '01. IEEE 2001 International. 2:706-708vol.2-706-708vol.2.
2001. An empirical study of a new approach to nearest neighbor searching. Algorithm Engineering and Experimentation. :172-187.
2001. Vision Geometry X. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 4476
2001. Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
2001. A simple entropy-based algorithm for planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :262-268.
2001. Entropy-preserving cuttings and space-efficient planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :256-261.
2001. Algorithms for facility location problems with outliers. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :642-651.
2001. Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
2001. A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry & Applications. 11(6):669-682.
2000
2000. Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.