dblp.uni-trier.dewww.uni-trier.de

David M. Mount Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
96EESunil Arya, Theocharis Malamatos, David M. Mount: The Effect of Corners on the Complexity of Approximate Range Searching. Discrete & Computational Geometry 41(3): 398-443 (2009)
2008
95EESunil Arya, David M. Mount, Antoine Vigneron, Jian Xia: Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA 2008: 112-123
94EESunil Arya, Guilherme Dias da Fonseca, David M. Mount: Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244
93EEMinkyoung Cho, David M. Mount: Embedding and similarity search for point sets under translation. Symposium on Computational Geometry 2008: 320-327
92EEMinkyoung Cho, David M. Mount: Improved Approximation Bounds for Planar Point Pattern Matching. Algorithmica 50(2): 175-207 (2008)
2007
91EENargess Memarsadeghi, David M. Mount: Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. International Conference on Computational Science (2) 2007: 503-510
90EESunil Arya, Theocharis Malamatos, David M. Mount: A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms 3(2): (2007)
89EEDavid 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)
88EENargess 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)
87EEF. 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)
86EESunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong: Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37(2): 584-610 (2007)
2006
85EEDavid M. Mount: Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. CCCG 2006
84EEF. Betul Atalay, David M. Mount: The Cost of Compatible Refinement of Simplex Decomposition Trees. IMR 2006: 57-69
83EESunil Arya, Theocharis Malamatos, David M. Mount: On the importance of idempotence. STOC 2006: 564-573
82EESunil Arya, Theocharis Malamatos, David M. Mount: The effect of corners on the complexity of approximate range searching. Symposium on Computational Geometry 2006: 11-20
81EEOvidiu Daescu, Jun Luo, David M. Mount: Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006)
80EEJeff Erickson, Sariel Har-Peled, David M. Mount: On the Least Median Square Problem. Discrete & Computational Geometry 36(4): 593-607 (2006)
2005
79EEOvidiu Daescu, Jun Luo, David M. Mount: Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231
78EESunil Arya, Theocharis Malamatos, David M. Mount: Space-time tradeoffs for approximate spherical range counting. SODA 2005: 535-544
77EEMinkyoung Cho, David M. Mount: Improved Approximation Bounds for Planar Point Pattern Matching. WADS 2005: 432-443
76EEDavid M. Mount: Editorial. Comput. Geom. 31(1-2): 1- (2005)
2004
75EEF. Betul Atalay, David M. Mount: Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. IMR 2004: 15-26
74EEDavid M. Mount: The ABCs of AVDs: Geometric Retrieval Made Simple. ISAAC 2004: 2
73EEDavid 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
72EEJeff Erickson, Sariel Har-Peled, David M. Mount: On the least median square problem. Symposium on Computational Geometry 2004: 273-279
71EETapas 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
68EESunil Arya, Theocharis Malamatos, David M. Mount: Space-efficient approximate Voronoi diagrams. STOC 2002: 721-730
67EETapas 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
66EEF. Betul Atalay, David M. Mount: Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. WSCG (Short Papers) 2002: 1-8
65EEPankaj 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)
64EETapas 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
63EESongrit Maneewongvatana, David M. Mount: An Empirical Study of a New Approach to Nearest Neighbor Searching. ALENEX 2001: 172-187
62EESongrit 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
61EESunil Arya, Theocharis Malamatos, David M. Mount: Entropy-preserving cuttings and space-efficient planar point location. SODA 2001: 256-261
60EESunil Arya, Theocharis Malamatos, David M. Mount: A simple entropy-based algorithm for planar point location. SODA 2001: 262-268
59EEMoses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan: Algorithms for facility location problems with outliers. SODA 2001: 642-651
58EESongrit 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)
56EEDavid 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
52EEMichael Murphy, David M. Mount, Carl W. Gable: A point-placement strategy for conforming Delaunay tetrahedralization. SODA 2000: 67-74
51EESunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan: Efficient Expected-Case Algorithms for Planar Point Location. SWAT 2000: 353-366
50EETapas 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
45EEDavid M. Mount, Fan-Tao Pu: Binary Space Partitions in Plücker Space. ALENEX 1999: 94-113
44EETapas 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
43EESongrit 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)
41EEDavid M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne: Efficient algorithms for robust feature matching. Pattern Recognition 32(1): 17-38 (1999)
1998
40EEDavid M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu: Quantile approximation for robust statistical estimation. CCCG 1998
39EEDavid 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
38EESunil 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)
36EESunil 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
31EEDavid 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)
30EESunil Arya, David M. Mount, Onuttom Narayan: Accounting for Boundary Effects in Nearest-Neighbor Searching. Discrete & Computational Geometry 16(2): 155-176 (1996)
1995
29EESunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid: Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498
28EESunil Arya, David M. Mount: Approximate Range Searching. Symposium on Computational Geometry 1995: 172-181
27EESunil 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
24EEJoseph 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
15EEDavid 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
8EEDavid 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
6EEDavid 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
2EEDavid 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

Coauthor Index

1Pankaj K. Agarwal [65]
2Esther M. Arkin [16] [22] [34]
3Sunil Arya [18] [19] [25] [26] [27] [28] [29] [30] [36] [38] [42] [49] [51] [53] [55] [60] [61] [68] [78] [82] [83] [86] [90] [94] [95] [96]
4F. Betul Atalay [66] [70] [75] [84] [87]
5László Babai [1]
6Patrice Belleville [22] [34]
7Sharat Chandran [12] [14]
8Moses Charikar [59]
9Siu-Wing Cheng [38] [51] [55]
10Minkyoung Cho [77] [92] [93]
11Ovidiu Daescu [79] [81]
12Gautam Das [29]
13Larry S. Davis [33]
14Michael B. Dillencourt [13] [21]
15Herbert Edelsbrunner [65]
16Jeff Erickson [65] [72] [80]
17Guilherme Dias da Fonseca [94]
18Carl W. Gable [52] [54]
19Subir Kumar Ghosh [5] [11]
20Michael T. Goodrich [16]
21D. Yu. Grigoryev [1]
22Leonidas J. Guibas [65]
23Sariel Har-Peled [65] [72] [80]
24Ramesh Hariharan [51]
25John Hershberger [65]
26Michael Isard [65]
27Christian S. Jensen [65]
28Tapas Kanungo [44] [50] [56] [64] [67] [71]
29Lydia E. Kavraki [65]
30Mark Keil [47]
31Samir Khuller [59]
32Sung Kwon Kim [14]
33Patrice Koehl [65]
34T. Yung Kong [7]
35Ming C. Lin [65]
36Jun Luo [79] [81]
37Theocharis Malamatos [53] [60] [61] [68] [78] [82] [83] [86] [90] [96]
38Songrit Maneewongvatana [43] [58] [62] [63]
39Dinesh Manocha [65]
40Jirí Matousek [17] [37]
41Nargess Memarsadeghi [88] [91]
42Dimitris N. Metaxas [65]
43Brian Mirtich [65]
44Joseph S. B. Mitchell [3] [16] [22] [24] [32] [34]
45Jacqueline Le Moigne [39] [41] [88]
46Michael Murphy [52] [54]
47S. Muthukrishnan (S. Muthu Muthukrishnan) [65]
48Giri Narasimhan [59]
49Onuttom Narayan [27] [30]
50Nathan S. Netanyahu [13] [17] [20] [23] [25] [35] [36] [37] [39] [40] [41] [44] [46] [48] [50] [56] [57] [64] [67] [71] [73] [88] [89]
51Dinesh K. Pai [65]
52Christos H. Papadimitriou [3]
53Christine D. Piatko [16] [40] [44] [46] [50] [56] [64] [67] [71] [73]
54Fan-Tao Pu [45]
55Enrico Puppo [33]
56Kathleen Romanik [22] [34] [35] [89]
57A. W. Roscoe (A. William Roscoe, Bill Roscoe) [7]
58Alan Saalfeld [8] [21]
59Elisha Sacks [65]
60Jeffrey S. Salowe [29]
61Steven Salzberg (Steven L. Salzberg) [22] [34]
62Ruth Silverman [6] [10] [25] [31] [35] [36] [40] [44] [46] [48] [50] [56] [64] [67] [71] [73] [89]
63Steven Skiena [16]
64Michiel H. M. Smid [26] [29] [42]
65Jack Snoeyink [65]
66Diane L. Souvaine [22] [34]
67Clifford Stein [69]
68Subhash Suri [24] [32] [65]
69Y. Ansel Teng [33]
70Antoine Vigneron [95]
71Stephen K. Wismath [47]
72Ouri Wolfson [65]
73Ka Chun Wong [86]
74Angela Y. Wu [25] [31] [35] [36] [40] [44] [46] [48] [50] [56] [64] [67] [71] [73] [89]
75Jian Xia [95]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)