Dave Mount

Professor

4246 Iribe Center

(301) 405-2704

(301) 405-6707

Academic Web Page

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

2000

Mount D, Netanyahu NS, Silverman R, Wu AY. 2000. Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry. 17(3–4):97-119.

Arya S, Malamatos T, Mount D. 2000. Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.

Keil M, Mount D, Wismath SK. 2000. Visibility stabs and depth-first spiralling on line segments in output sensitive time. International Journal of Computational Geometry and Applications. 10(5):535-552.

Le Moigne J, Netanyahu NS, Masek JG, Mount D, Goward S, Honzak M. 2000. Geo-registration of Landsat data by robust matching of wavelet features. Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International. 4:1610-1612vol.4-1610-1612vol.4.

Mount D, Netanyahu NS, Piatko CD, Silverman R, Wu AY. 2000. Quantile approximation for robust statistical estimation and k-enclosing problems. International Journal of Computational Geometry and Applications. 10(6):593-608.

Kanungo T, Mount D, Netanyahu NS, Piatko C, Silverman R, Wu AY. 2000. The analysis of a simple k-means clustering algorithm. Proceedings of the sixteenth annual symposium on Computational geometry. :100-109.

Arya S, Cheng SW, Mount D, Ramesh H. 2000. Efficient expected-case algorithms for planar point location. Algorithm Theory-SWAT 2000. :537-543.

Arya S, Mount D. 2000. Approximate range searching. Computational Geometry. 17(3–4):135-152.

Murphy M, Mount D, Gable CW. 2000. A point-placement strategy for conforming Delaunay tetrahedralization. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :67-74.

1999

Mount D, Netanyahu NS, Le Moigne J. 1999. Efficient algorithms for robust feature matching. Pattern Recognition. 32(1):17-38.

Kanungo T, Mount D, Netanyahu NS, Piatko C, Silverman R, Wu AY. 1999. Computing nearest neighbors for moving points and applications to clustering. Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. :931-932.

Maneewongvatana S, Mount D. 1999. It’s okay to be skinny, if your friends are fat. Center for Geometric Computing 4th Annual Workshop on Computational Geometry.

Mount D, Pu FT. 1999. Binary space parititions in plücker space. Algorithm Engineering and Experimentation. :663-663.

Latecki LJ, Melter RA, Mount D, Wu AY. 1999. Vision geometry VIII(Denver CO, 19-20 July 1999). SPIE proceedings series.

1998

Matoušek J, Mount D, Netanyahu NS. 1998. Efficient randomized algorithms for the repeated median line estimator. Algorithmica. 20(2):136-150.

Arya S, Cheng S-W, Mount D. 1998. Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.

Mount D, Netanyahu NS, LeMoigne J. 1998. Improved algorithms for robust point pattern matching and applications to image registration. Proceedings of the fourteenth annual symposium on Computational geometry. :155-164.

Kanungo T, Mount D, Netanyahu NS, Piatko C, Silverman R, Wu AY. 1998. Approximating large convolutions in digital images. PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING. :216-227.

Mount D. 1998. ANN programming manual.

Mount D, Pu F-T. 1998. Stabbing Orthogonal Objects in 3-Space. UMIACS-TR-96-71

Mount D, Silverman R. 1998. Minimum Enclosures with Specified Angles. CS-TR-3219

Arya S, Mount D, Netanyahu NS, Silverman R, Wu AY. 1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.

Mount D, Silverman R, Wu AY. 1998. On the Area of Overlap of Translated Polygons. CS-TR-3201

1997

Mount D, Netanyahu NS, Le Moigne J. 1997. Efficient algorithms for robust feature matching. Image Registration Workshop Proceedings.

Teng YA, Mount D, Puppo E, Davis LS. 1997. Parallelizing and algorithm for visibility on polyhedral terrain. International Journal of Computational Geometry and Applications. 7(1/2):75-84.

Mount D. 1997. Geometric intersection. Handbook of Discrete and Computational Geometry, chapter 33. :615-632.

Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY. 1997. A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.

Mount D, Arya S. 1997. ANN: A library for approximate nearest neighbor searching. CGC 2nd Annual Fall Workshop on Computational Geometry.

Arkin EM, Belleville P, Mitchell JSB, Mount D, Romanik K, Salzberg S, Souvaine D. 1997. Testing simple polygons. Computational Geometry. 8(2):97-114.

1996

Arya S, Mount D, Narayan O. 1996. Accounting for boundary effects in nearest-neighbor searching. Discrete & Computational Geometry. 16(2):155-176.

1995

Arya S, Mount D. 1995. Approximate range searching. Proceedings of the eleventh annual symposium on Computational geometry. :172-181.

Arya S, Dast G, Mount D, Salowe JS, Smid M. 1995. M.H.M: Euclidean spanners: short, thin, and lanky. In: 27th ACM Symposium on Theory of Computing. :489-498.

Arya S, Das G, Mount D, Salowe JS, Smid M. 1995. Euclidean spanners: short, thin, and lanky. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :489-498.

1994

Arya S, Mount D, Smid M. 1994. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications. 13:13-91.

Arya S, Mount D, Smid M. 1994. Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.

Mount D, Netanyahu NS. 1994. Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Models and Image Processing. 56(4):289-303.

Mitchell JSB, Mount D, Suri S. 1994. Query-sensitive ray shooting. Proceedings of the tenth annual symposium on Computational geometry. :359-368.

1993

Dillencourt MB, Mount D, Saalfeld AJ. 1993. On The Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario. :49-54.

Mount D, Netanyahu NS. 1993. Efficient algorithms for robust circular arc estimators. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada.

Arya S, Mount D. 1993. Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.

Mount D, Silverman R, Wu A. 1993. On the area of overlap of translated polygons. SPIE Vision Geometry II. 2060:254-264.

Sharma R, Mount D, Aloimonos Y. 1993. Probabilistic analysis of some navigation strategies in a dynamic environment. Systems, Man and Cybernetics, IEEE Transactions on. 23(5):1465-1474.

Arkin E, Goodrich M, Mitchell J, Mount D, Piatko C, Skiena S. 1993. Point probe decision trees for geometric concept classes. Algorithms and Data Structures. :95-106.

Arya S, Mount D. 1993. Approximate nearest neighbor queries in fixed dimensions. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. :271-280.

Arya S, Mount D. 1993. Algorithms for fast vector quantization. Data Compression Conference, 1993. DCC '93.. :381-390.

Arya S, Phamdo N, Farvardin N, Mount D. 1993. Fast search algorithms with applications to split and multi-stage vector quantization of speech lsp parameters. Speech Coding for Telecommunications, 1993. Proceedings., IEEE Workshop on. :65-66.

1992

Chandran S, Kim SK, Mount D. 1992. Parallel computational geometry of rectangles. Algorithmica. 7(1):25-49.

Chandran S, Mount D. 1992. A parallel algorithm for enclosed and enclosing triangles. International Journal of Computational Geometry and Applications. 2(2):191-214.

Dillencourt MB, Mount D, Netanyahu NS. 1992. A randomized algorithm for slope selection. International Journal of Computational Geometry and Applications. 2(1):1-27.

Kao TC, Mount D. 1992. Incremental construction and dynamic maintenance of constrained Delaunay triangulations. Proceedings of the 4th Canadian Conference on Computational Geometry. :170-175.

Posenau M-AK, Mount D. 1992. Delaunay triangulation and computational fluid dynamics meshes. Proceedings of the 4th Canadian Conference on Computational Geometry. :316-321.

Mount D. 1992. Intersection detection and separators for simple polygons. Proceedings of the eighth annual symposium on Computational geometry. :303-311.

1991

Mount D. 1991. The densest double-lattice packing of a convex polygon. Discrete and Computational Geometry: Papers from the DIMACS Special Year. 6:245-262.

Kao TC, Mount D. 1991. Computing generalized Voronoi diagrams in improved time and space bounds.

Mount D, Silverman R. 1991. Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.

Banerjee S, Mount D, Rosenfeld A. 1991. Pyramid computation of neighbor distance statistics in dot patterns. CVGIP: Graphical Models and Image Processing. 53(4):373-381.

1990

Mount D. 1990. The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.

Mount D, Silverman R. 1990. Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.

1988

Mount D, Chandran S. 1988. A united approach to finding enclosing and enclosed triangles. Proceedings of 26th Allerton Conference on Communication, Control and Computing.

Mount D, Saalfeld A. 1988. Globally-Equiangular triangulations of co-circular points in 0(n log n) time. Proceedings of the fourth annual symposium on Computational geometry. :143-152.

Kong TY, Mount D, Roscoe AW. 1988. The decomposition of a rectangle into rectangles of minimal perimeter. SIAM Journal on Computing. 17:1215-1215.

1987

Mount D. 1987. Storing the subdivision of a polyhedral surface. Discrete & Computational Geometry. 2(1):153-174.

Kong TY, Mount D, Werman M. 1987. The decomposition of a square into rectangles of minimal perimeter. Discrete Applied Mathematics. 16(3):239-243.

Mount D, Silverman R. 1987. Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. Proceedings of the 15th annual conference on Computer Science. :439–-439–.

Ghosh S K, Mount D. 1987. An output sensitive algorithm for computing visibility graphs. Foundations of Computer Science, 1987., 28th Annual Symposium on. :11-19.

JOSEPH SB, Mount D, Papadimitriou CH. 1987. THE DISCRETE GEODESIC PROBLEM. SIAM Journal on Computing (SICOMP). 16(4)

Chandran S, Mount D. 1987. Shared memory algorithms and the medial axis transform. IEEE Workshop on Computer Architecture for PAMI. :44-50.

1985

Mount D. 1985. On Finding Shortest Paths on Convex Polyhedra..

Mount D. 1985. Voronoi Diagrams on the Surface of a Polyhedron..

1982

Babai L, Grigoryev Y.D, Mount D. 1982. Isomorphism of graphs with bounded eigenvalue multiplicity. Proceedings of the fourteenth annual ACM symposium on Theory of computing. :310-324.