2008 | ||
---|---|---|
95 | EE | Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia: Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA 2008: 112-123 |
94 | EE | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount: Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244 |
93 | EE | Minkyoung Cho, David M. Mount: Embedding and similarity search for point sets under translation. Symposium on Computational Geometry 2008: 320-327 |
92 | EE | Minkyoung Cho, David M. Mount: Improved Approximation Bounds for Planar Point Pattern Matching. Algorithmica 50(2): 175-207 (2008) |
2007 | ||
91 | EE | Nargess Memarsadeghi, David M. Mount: Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. International Conference on Computational Science (2) 2007: 503-510 |
90 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms 3(2): (2007) |
89 | EE | David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu: A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis 51(5): 2461-2486 (2007) |
88 | EE | Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne: A Fast Implementation of the Isodata Clustering Algorithm. Int. J. Comput. Geometry Appl. 17(1): 71-103 (2007) |
87 | EE | F. Betul Atalay, David M. Mount: Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. Int. J. Comput. Geometry Appl. 17(6): 595-631 (2007) |
86 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong: Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37(2): 584-610 (2007) |
2006 | ||
85 | EE | David M. Mount: Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. CCCG 2006 |
84 | EE | F. Betul Atalay, David M. Mount: The Cost of Compatible Refinement of Simplex Decomposition Trees. IMR 2006: 57-69 |
83 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: On the importance of idempotence. STOC 2006: 564-573 |
82 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: The effect of corners on the complexity of approximate range searching. Symposium on Computational Geometry 2006: 11-20 |
81 | EE | Ovidiu Daescu, Jun Luo, David M. Mount: Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006) |
80 | EE | Jeff Erickson, Sariel Har-Peled, David M. Mount: On the Least Median Square Problem. Discrete & Computational Geometry 36(4): 593-607 (2006) |
2005 | ||
79 | EE | Ovidiu Daescu, Jun Luo, David M. Mount: Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231 |
78 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: Space-time tradeoffs for approximate spherical range counting. SODA 2005: 535-544 |
77 | EE | Minkyoung Cho, David M. Mount: Improved Approximation Bounds for Planar Point Pattern Matching. WADS 2005: 432-443 |
76 | EE | David M. Mount: Editorial. Comput. Geom. 31(1-2): 1- (2005) |
2004 | ||
75 | EE | F. Betul Atalay, David M. Mount: Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. IMR 2004: 15-26 |
74 | EE | David M. Mount: The ABCs of AVDs: Geometric Retrieval Made Simple. ISAAC 2004: 2 |
73 | EE | David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: A computational framework for incremental motion. Symposium on Computational Geometry 2004: 200-209 |
72 | EE | Jeff Erickson, Sariel Har-Peled, David M. Mount: On the least median square problem. Symposium on Computational Geometry 2004: 273-279 |
71 | EE | Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: A local search approximation algorithm for k-means clustering. Comput. Geom. 28(2-3): 89-112 (2004) |
2003 | ||
70 | F. Betul Atalay, David M. Mount: Interpolation over Light Fields with Applications in Computer Graphics. ALENEX 2003: 56-68 | |
2002 | ||
69 | David M. Mount, Clifford Stein: Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers Springer 2002 | |
68 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: Space-efficient approximate Voronoi diagrams. STOC 2002: 721-730 |
67 | EE | Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: A local search approximation algorithm for k-means clustering. Symposium on Computational Geometry 2002: 10-18 |
66 | EE | F. Betul Atalay, David M. Mount: Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. WSCG (Short Papers) 2002: 1-8 |
65 | EE | Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson: Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) |
64 | EE | Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7): 881-892 (2002) |
2001 | ||
63 | EE | Songrit Maneewongvatana, David M. Mount: An Empirical Study of a New Approach to Nearest Neighbor Searching. ALENEX 2001: 172-187 |
62 | EE | Songrit Maneewongvatana, David M. Mount: On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions. International Conference on Computational Science (1) 2001: 842-851 |
61 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: Entropy-preserving cuttings and space-efficient planar point location. SODA 2001: 256-261 |
60 | EE | Sunil Arya, Theocharis Malamatos, David M. Mount: A simple entropy-based algorithm for planar point location. SODA 2001: 262-268 |
59 | EE | Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan: Algorithms for facility location problems with outliers. SODA 2001: 642-651 |
58 | EE | Songrit Maneewongvatana, David M. Mount: The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. WADS 2001: 276-286 |
57 | David M. Mount, Nathan S. Netanyahu: Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Comput. Geom. 19(1): 1-33 (2001) | |
56 | EE | David M. Mount, Tapas Kanungo, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: Approximating large convolutions in digital images. IEEE Transactions on Image Processing 10(12): 1826-1835 (2001) |
55 | Sunil Arya, Siu-Wing Cheng, David M. Mount: Approximation Algorithm for Multiple-Tool Milling. Int. J. Comput. Geometry Appl. 11(3): 339-372 (2001) | |
54 | Michael Murphy, David M. Mount, Carl W. Gable: A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. Int. J. Comput. Geometry Appl. 11(6): 669-682 (2001) | |
2000 | ||
53 | Sunil Arya, Theocharis Malamatos, David M. Mount: Nearly Optimal Expected-Case Planar Point Location. FOCS 2000: 208-218 | |
52 | EE | Michael Murphy, David M. Mount, Carl W. Gable: A point-placement strategy for conforming Delaunay tetrahedralization. SODA 2000: 67-74 |
51 | EE | Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan: Efficient Expected-Case Algorithms for Planar Point Location. SWAT 2000: 353-366 |
50 | EE | Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: The analysis of a simple k-means clustering algorithm. Symposium on Computational Geometry 2000: 100-109 |
49 | Sunil Arya, David M. Mount: Approximate range searching. Comput. Geom. 17(3-4): 135-152 (2000) | |
48 | David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu: Chromatic nearest neighbor searching: A query sensitive approach. Comput. Geom. 17(3-4): 97-119 (2000) | |
47 | Mark Keil, David M. Mount, Stephen K. Wismath: Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. Int. J. Comput. Geometry Appl. 10(5): 535-552 (2000) | |
46 | David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. Int. J. Comput. Geometry Appl. 10(6): 593-608 (2000) | |
1999 | ||
45 | EE | David M. Mount, Fan-Tao Pu: Binary Space Partitions in Plücker Space. ALENEX 1999: 94-113 |
44 | EE | Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: Computing Nearest Neighbors for Moving Points and Applications to Clustering. SODA 1999: 931-932 |
43 | EE | Songrit Maneewongvatana, David M. Mount: Analysis of approximate nearest neighbor searching with clustered point sets CoRR cs.CG/9901013: (1999) |
42 | Sunil Arya, David M. Mount, Michiel H. M. Smid: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. 13(2): 91-107 (1999) | |
41 | EE | David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne: Efficient algorithms for robust feature matching. Pattern Recognition 32(1): 17-38 (1999) |
1998 | ||
40 | EE | David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: Quantile approximation for robust statistical estimation. CCCG 1998 |
39 | EE | David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne: Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. Symposium on Computational Geometry 1998: 155-164 |
38 | EE | Sunil Arya, Siu-Wing Cheng, David M. Mount: Approximation Algorithms for Multiple-Tool Miling. Symposium on Computational Geometry 1998: 297-306 |
37 | Jirí Matousek, David M. Mount, Nathan S. Netanyahu: Efficient Randomized Algorithms for the Repeated Median Line Estimator. Algorithmica 20(2): 136-150 (1998) | |
36 | EE | Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu: An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. J. ACM 45(6): 891-923 (1998) |
1997 | ||
35 | David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu: A Practical Approximation Algorithm for the LMS Line Estimator. SODA 1997: 473-482 | |
34 | Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine: Testing Simple Polygons. Comput. Geom. 8: 97-114 (1997) | |
33 | Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis: Parallelizing and Algorithm for Visibility on Polyhedral Terrain. Int. J. Comput. Geometry Appl. 7(1/2): 75-84 (1997) | |
32 | Joseph S. B. Mitchell, David M. Mount, Subhash Suri: Query-Sensitive Ray Shooting. Int. J. Comput. Geometry Appl. 7(4): 317-347 (1997) | |
1996 | ||
31 | EE | David M. Mount, Ruth Silverman, Angela Y. Wu: On the Area of Overlap of Translated Polygons. Computer Vision and Image Understanding 64(1): 53-61 (1996) |
30 | EE | Sunil Arya, David M. Mount, Onuttom Narayan: Accounting for Boundary Effects in Nearest-Neighbor Searching. Discrete & Computational Geometry 16(2): 155-176 (1996) |
1995 | ||
29 | EE | Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid: Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 |
28 | EE | Sunil Arya, David M. Mount: Approximate Range Searching. Symposium on Computational Geometry 1995: 172-181 |
27 | EE | Sunil Arya, David M. Mount, Onuttom Narayan: Accounting for Boundary Effects in Nearest Neighbor Searching. Symposium on Computational Geometry 1995: 336-344 |
1994 | ||
26 | Sunil Arya, David M. Mount, Michiel H. M. Smid: Randomized and deterministic algorithms for geometric spanners of small diameter FOCS 1994: 703-712 | |
25 | Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu: An Optimal Algorithm for Approximate Nearest Neighbor Searching. SODA 1994: 573-582 | |
24 | EE | Joseph S. B. Mitchell, David M. Mount, Subhash Suri: Query-Sensitive Ray Shooting. Symposium on Computational Geometry 1994: 359-368 |
23 | David M. Mount, Nathan S. Netanyahu: Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Model and Image Processing 56(4): 289-303 (1994) | |
1993 | ||
22 | Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine: Testing Simple Polygons. CCCG 1993: 387 | |
21 | Michael B. Dillencourt, David M. Mount, Alan Saalfeld: On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. CCCG 1993: 49-54 | |
20 | David M. Mount, Nathan S. Netanyahu: Efficient Algorithms for Robust Circular Arc Estimators. CCCG 1993: 79-84 | |
19 | Sunil Arya, David M. Mount: Algorithms for Fast Vector Quantizaton. Data Compression Conference 1993: 381-390 | |
18 | Sunil Arya, David M. Mount: Approximate Nearest Neighbor Queries in Fixed Dimensions. SODA 1993: 271-280 | |
17 | Jirí Matousek, David M. Mount, Nathan S. Netanyahu: Efficient Randomized Algorithms for the Repeated Median Line Estimator. SODA 1993: 74-82 | |
16 | Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena: Point Probe Decision Trees for Geometric Concept Classes. WADS 1993: 95-106 | |
1992 | ||
15 | EE | David M. Mount: Intersection Detection and Separators for Simple Polygons. Symposium on Computational Geometry 1992: 303-311 |
14 | Sharat Chandran, Sung Kwon Kim, David M. Mount: Parallel Computational Geometry of Rectangles. Algorithmica 7(1): 25-49 (1992) | |
13 | Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu: A randomized algorithm for slope selection. Int. J. Comput. Geometry Appl. 2(1): 1-27 (1992) | |
12 | Sharat Chandran, David M. Mount: A parallel algorithm for enclosed and enclosing triangles. Int. J. Comput. Geometry Appl. 2(2): 191-214 (1992) | |
1991 | ||
11 | Subir Kumar Ghosh, David M. Mount: An Output-Sensitive Algorithm for Computing Visibility Graphs. SIAM J. Comput. 20(5): 888-910 (1991) | |
1990 | ||
10 | David M. Mount, Ruth Silverman: Packing and Covering the Plane with Translates of a Convex Polygon. J. Algorithms 11(4): 564-580 (1990) | |
9 | David M. Mount: The Number of Shortest Paths on the Surface of a Polyhedron. SIAM J. Comput. 19(4): 593-611 (1990) | |
1988 | ||
8 | EE | David M. Mount, Alan Saalfeld: Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. Symposium on Computational Geometry 1988: 143-152 |
7 | T. Yung Kong, David M. Mount, A. W. Roscoe: The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. SIAM J. Comput. 17(6): 1215-1231 (1988) | |
1987 | ||
6 | EE | David M. Mount, Ruth Silverman: Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. ACM Conference on Computer Science 1987: 439 |
5 | Subir Kumar Ghosh, David M. Mount: An Output Sensitive Algorithm for Computing Visibility Graphs FOCS 1987: 11-19 | |
4 | David M. Mount: Storing the Subdivision of a Polyhedral Surface. Discrete & Computational Geometry 2: 153-174 (1987) | |
3 | Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou: The Discrete Geodesic Problem. SIAM J. Comput. 16(4): 647-668 (1987) | |
1986 | ||
2 | EE | David M. Mount: Storing the Subdivision of a Polyhedral Surface. Symposium on Computational Geometry 1986: 150-158 |
1982 | ||
1 | László Babai, D. Yu. Grigoryev, David M. Mount: Isomorphism of Graphs with Bounded Eigenvalue Multiplicity STOC 1982: 310-324 |