default search action
David M. Mount
Person information
- affiliation: University of Maryland, Department of Computer Science, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j60]Sunil Arya
, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SIAM J. Comput. 53(4): 1002-1038 (2024) - [c101]Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, David M. Mount:
Ipelets for the Convex Polygonal Geometry (Media Exposition). SoCG 2024: 92:1-92:7 - [c100]Ahmed Abdelkader, David M. Mount:
Convex Approximation and the Hilbert Geometry. SOSA 2024: 286-298 - [c99]Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount:
Delaunay Triangulations in the Hilbert Metric. SWAT 2024: 25:1-25:17 - [i26]Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, David M. Mount:
Ipelets for the Convex Polygonal Geometry. CoRR abs/2403.10033 (2024) - [i25]Aditya Acharya, David M. Mount:
Evolving Distributions Under Local Motion. CoRR abs/2409.11779 (2024) - 2023
- [c98]Auguste H. Gezalyan, Madeline Bumpus, Xufeng Dai, Sam Muñoz, Renita Santhoshkumar, Songyu Ye, David M. Mount:
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. CCCG 2023: 249-255 - [c97]Sunil Arya, David M. Mount
Optimal Volume-Sensitive Bounds for Polytope Approximation. SoCG 2023: 9:1-9:16 - [c96]Auguste H. Gezalyan, David M. Mount
Voronoi Diagrams in the Hilbert Metric. SoCG 2023: 35:1-35:16 - [c95]Ahmed Abdelkader, David M. Mount:
Smooth Distance Approximation. ESA 2023: 5:1-5:18 - [c94]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SODA 2023: 1834-1861 - [i24]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. CoRR abs/2303.08349 (2023) - [i23]Sunil Arya, David M. Mount:
Optimal Volume-Sensitive Bounds for Polytope Approximation. CoRR abs/2303.09586 (2023) - [i22]Madeline Bumpus, Xufeng Caesar Dai, Auguste H. Gezalyan, Sam Muñoz, Renita Santhoshkumar, Songyu Ye, David M. Mount:
Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. CoRR abs/2304.02745 (2023) - [i21]Aditya Acharya, David M. Mount:
Tracking Evolving labels using Cone based Oracles. CoRR abs/2306.03306 (2023) - [i20]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR abs/2306.15621 (2023) - [i19]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR abs/2306.15648 (2023) - [i18]Ahmed Abdelkader, David M. Mount:
Smooth Distance Approximation. CoRR abs/2308.08791 (2023) - [i17]Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount:
Delaunay Triangulations in the Hilbert Metric. CoRR abs/2312.05987 (2023) - 2022
- [j59]Rahul Arya
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms 18(4): 35:1-35:29 (2022) - [j58]Victor Junqiu Wei
Proximity Queries on Terrain Surface. ACM Trans. Database Syst. 47(4): 15:1-15:59 (2022) - [c93]Aditya Acharya, David M. Mount:
Optimally Tracking Labels on an Evolving Tree. CCCG 2022: 1-8 - [c92]Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel:
Optimally Confining Lattice Polymers. CCCG 2022: 24-15 - [i16]Aditya Acharya, David M. Mount:
Optimally Tracking Labels on an Evolving Tree. CoRR abs/2203.16264 (2022) - [i15]Gill Barequet, Shion Fukuzawa
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CoRR abs/2208.05597 (2022) - 2021
- [j57]Alejandro Flores-Velazco
Guarantees on nearest-neighbor condensation heuristics. Comput. Geom. 95: 101732 (2021) - [c91]Ahmed Abdelkader, David M. Mount:
Approximate Nearest-Neighbor Search for Line Segments. SoCG 2021: 4:1-4:15 - [c90]Alejandro Flores-Velazco
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. ESA 2021: 44:1-44:15 - [i14]Ahmed Abdelkader, David M. Mount:
Approximate Nearest-Neighbor Search for Line Segments. CoRR abs/2103.16071 (2021) - [i13]Auguste H. Gezalyan, David M. Mount:
Voronoi Diagrams in the Hilbert Metric. CoRR abs/2112.03056 (2021) - [i12]Mary Monroe, David M. Mount:
A PTAS for the Min-Max Euclidean Multiple TSP. CoRR abs/2112.04325 (2021) - 2020
- [c89]Alejandro Flores-Velazco
Coresets for the Nearest-Neighbor Rule. ESA 2020: 47:1-47:19 - [c88]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA 2020: 786-805 - [i11]Alejandro Flores-Velazco
Coresets for the Nearest-Neighbor Rule. CoRR abs/2002.06650 (2020)
2010 – 2019
- 2019
- [j56]Philip Dasler
Modular Circulation and Applications to Traffic Management. Algorithmica 81(10): 4098-4117 (2019) - [j55]F. Betül Atalay, David M. Mount
Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions. Comput. Geom. 79: 14-29 (2019) - [c87]David M. Mount
New Directions in Approximate Nearest-Neighbor Searching. CALDAM 2019: 1-15 - [c86]Alejandro Flores-Velazco, David M. Mount:
Guarantees on Nearest-Neighbor Condensation heuristics. CCCG 2019: 87-93 - [c85]Philip Dasler
Online Algorithms for Warehouse Management. ISAAC 2019: 56:1-56:21 - [c84]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA 2019: 355-372 - [i10]Alejandro Flores-Velazco
Guarantees on Nearest-Neighbor Condensation heuristics. CoRR abs/1904.12142 (2019) - [i9]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1910.14459 (2019) - 2018
- [j54]Sunil Arya, Guilherme Dias da Fonseca
Approximate Polytope Membership Queries. SIAM J. Comput. 47(1): 1-51 (2018) - [c83]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA 2018: 3:1-3:14 - [c82]Ahmed Abdelkader, David M. Mount
Economical Delone Sets for Approximating Convex Bodies. SWAT 2018: 4:1-4:12 - [i8]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR abs/1807.00484 (2018) - 2017
- [j53]Sunil Arya, Guilherme Dias da Fonseca
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58(4): 849-870 (2017) - [c81]Sunil Arya, Guilherme Dias da Fonseca
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG 2017: 10:1-10:15 - [c80]Victor Junqiu Wei
Distance Oracle on Terrain Surface. SIGMOD Conference 2017: 1211-1226 - [c79]Sunil Arya, Guilherme Dias da Fonseca
Optimal Approximate Polytope Membership. SODA 2017: 270-288 - [c78]Philip Dasler
Modular Circulation and Applications to Traffic Management. WADS 2017: 277-288 - [i7]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal ε-Kernel Construction and Related Problems. CoRR abs/1703.10868 (2017) - 2016
- [j52]David M. Mount
A practical approximation algorithm for the LTS estimator. Comput. Stat. Data Anal. 99: 148-170 (2016) - [j51]Sariel Har-Peled
Space Exploration via Proximity Search. Discret. Comput. Geom. 56(2): 357-376 (2016) - [c77]Sunil Arya, Guilherme Dias da Fonseca
On the Combinatorial Complexity of Approximating Polytopes. SoCG 2016: 11:1-11:15 - [c76]Sunil Arya, David M. Mount
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. SODA 2016: 1220-1233 - [i6]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1604.01175 (2016) - [i5]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. CoRR abs/1604.01183 (2016) - [i4]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. CoRR abs/1612.01696 (2016) - 2015
- [j50]Sorelle A. Friedler, David M. Mount
A sensor-based framework for kinetic data compression. Comput. Geom. 48(3): 147-168 (2015) - [c75]Sariel Har-Peled
Space Exploration via Proximity Search. SoCG 2015: 374-389 - [c74]Sunil Arya, David M. Mount, Eunhui Park:
Approximate Geometric MST Range Queries. SoCG 2015: 781-795 - [c73]Philip Dasler
On the Complexity of an Unregulated Traffic Crossing. WADS 2015: 224-235 - [i3]Philip Dasler, David M. Mount:
On the Complexity of an Unregulated Traffic Crossing. CoRR abs/1505.00874 (2015) - 2014
- [j49]David M. Mount
On the Least Trimmed Squares Estimator. Algorithmica 69(1): 148-183 (2014) - [c72]Prayaag Venkat, David M. Mount:
A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets. CCCG 2014 - [i2]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. CoRR abs/1412.1398 (2014) - 2013
- [c71]Eunhui Park, David M. Mount
Output-sensitive well-separated pair decompositions for dynamic point sets. SIGSPATIAL/GIS 2013: 344-353 - 2012
- [j48]Xiangzhi Wei, Ajay Joneja
Optimal uniformly monotone partitioning of polygons with holes. Comput. Aided Des. 44(12): 1235-1252 (2012) - [j47]Sunil Arya, David M. Mount
Tight Lower Bounds for Halfspace Range Searching. Discret. Comput. Geom. 47(4): 711-730 (2012) - [c70]Sunil Arya, Guilherme Dias da Fonseca
Optimal area-sensitive bounds for polytope approximation. SCG 2012: 363-372 - [c69]Eunhui Park, David M. Mount
A Self-adjusting Data Structure for Multidimensional Point Sets. ESA 2012: 778-789 - [c68]Sunil Arya, Guilherme Dias da Fonseca
Polytope approximation and the Mahler volume. SODA 2012: 29-42 - 2011
- [c67]Sunil Arya, Guilherme Dias da Fonseca
Approximate polytope membership queries. STOC 2011: 579-586 - [p1]David M. Mount, Nathan S. Netanyahu, San Ratanasanya:
New approaches to robust, point-based image registration. Image Registration for Remote Sensing 2011: 179-199 - 2010
- [j46]Guilherme Dias da Fonseca
Approximate range searching: The absolute model. Comput. Geom. 43(4): 434-444 (2010) - [j45]Sorelle A. Friedler, David M. Mount
Approximation algorithm for the kinetic robust K-center problem. Comput. Geom. 43(6-7): 572-586 (2010) - [c66]Sunil Arya, David M. Mount
Tight lower bounds for halfspace range searching. SCG 2010: 29-37 - [c65]David M. Mount
A dynamic data structure for approximate range searching. SCG 2010: 247-256 - [c64]Sunil Arya, Guilherme Dias da Fonseca
A Unified Approach to Approximate Proximity Searching. ESA (1) 2010: 374-385 - [c63]Sorelle A. Friedler, David M. Mount
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. ESA (1) 2010: 386-397
2000 – 2009
- 2009
- [j44]Sunil Arya, Theocharis Malamatos, David M. Mount
The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. 41(3): 398-443 (2009) - [j43]Sunil Arya, Theocharis Malamatos, David M. Mount
Space-time tradeoffs for approximate nearest neighbor searching. J. ACM 57(1): 1:1-1:54 (2009) - [c62]Sorelle A. Friedler, David M. Mount
Compressing Kinetic Data from Sensor Networks. ALGOSENSORS 2009: 191-202 - [c61]Minkyoung Cho, David M. Mount
Maintaining Nets and Net Trees under Incremental Motion. ISAAC 2009: 1134-1143 - 2008
- [j42]Minkyoung Cho, David M. Mount
Improved Approximation Bounds for Planar Point Pattern Matching. Algorithmica 50(2): 175-207 (2008) - [c60]Minkyoung Cho, David M. Mount
Embedding and similarity search for point sets under translation. SCG 2008: 320-327 - [c59]Sunil Arya, David M. Mount
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA 2008: 112-123 - [c58]Sunil Arya, Guilherme Dias da Fonseca
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244 - 2007
- [j41]David M. Mount
A practical approximation algorithm for the LMS line estimator. Comput. Stat. Data Anal. 51(5): 2461-2486 (2007) - [j40]Nargess Memarsadeghi
A Fast Implementation of the Isodata Clustering Algorithm. Int. J. Comput. Geom. Appl. 17(1): 71-103 (2007) - [j39]F. Betül Atalay, David M. Mount
Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. Int. J. Comput. Geom. Appl. 17(6): 595-631 (2007) - [j38]Sunil Arya, Theocharis Malamatos, David M. Mount
Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37(2): 584-610 (2007) - [j37]Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms 3(2): 17 (2007) - [c57]Nargess Memarsadeghi
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. International Conference on Computational Science (2) 2007: 503-510 - 2006
- [j36]Ovidiu Daescu, Jun Luo, David M. Mount
Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006) - [j35]Jeff Erickson, Sariel Har-Peled
On the Least Median Square Problem. Discret. Comput. Geom. 36(4): 593-607 (2006) - [c56]David M. Mount:
Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. ALENEX 2006: 65 - [c55]David M. Mount:
Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. CCCG 2006 - [c54]Sunil Arya, Theocharis Malamatos, David M. Mount:
The effect of corners on the complexity of approximate range searching. SCG 2006: 11-20 - [c53]Jacqueline Le Moigne, Arlene A. Cole-Rhodes, Roger D. Eastman, Peyush Jain, Aimee Joshua, Nargess Memarsadeghi
Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data. ICASSP (5) 2006: 1189-1192 - [c52]Nargess Memarsadeghi
Image Fusion Using Cokriging. IGARSS 2006: 2518-2521 - [c51]F. Betül Atalay, David M. Mount:
The Cost of Compatible Refinement of Simplex Decomposition Trees. IMR 2006: 57-69 - [c50]Sunil Arya, Theocharis Malamatos, David M. Mount
On the importance of idempotence. STOC 2006: 564-573 - 2005
- [j34]David M. Mount:
Editorial. Comput. Geom. 31(1-2): 1 (2005) - [c49]Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231 - [c48]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-time tradeoffs for approximate spherical range counting. SODA 2005: 535-544 - [c47]Minkyoung Cho, David M. Mount:
Improved Approximation Bounds for Planar Point Pattern Matching. WADS 2005: 432-443 - 2004
- [b2]Michael T. Goodrich, Roberto Tamassia, David M. Mount:
Data structures and algorithms in C++. Wiley 2004, ISBN 978-0-471-42924-1, pp. I-XV, 1-683 - [j33]Tapas Kanungo, David M. Mount
A local search approximation algorithm for k-means clustering. Comput. Geom. 28(2-3): 89-112 (2004) - [c46]David M. Mount, Nathan S. Netanyahu, Christine D. Piatko
A computational framework for incremental motion. SCG 2004: 200-209 - [c45]Jeff Erickson, Sariel Har-Peled
On the least median square problem. SCG 2004: 273-279 - [c44]F. Betül Atalay, David M. Mount:
Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. IMR 2004: 15-26 - [c43]David M. Mount:
The ABCs of AVDs: Geometric Retrieval Made Simple. ISAAC 2004: 2 - [r2]David M. Mount:
Geometric Intersection. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 857-876 - [r1]Sunil Arya, David M. Mount:
Computational Geometry. Handbook of Data Structures and Applications 2004 - 2003
- [c42]F. Betül Atalay, David M. Mount:
Interpolation over Light Fields with Applications in Computer Graphics. ALENEX 2003: 56-68 - [c41]Nargess Memarsadeghi
A fast implementation of the ISOCLUS algorithm. IGARSS 2003: 2057-2059 - 2002
- [j32]Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j31]Tapas Kanungo, David M. Mount
An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7): 881-892 (2002) - [c40]Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko
A local search approximation algorithm for k-means clustering. SCG 2002: 10-18 - [c39]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-efficient approximate Voronoi diagrams. STOC 2002: 721-730 - [c38]F. Betül Atalay, David M. Mount:
Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. WSCG (Short Papers) 2002: 1-8 - [e1]David M. Mount, Clifford Stein:
Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers. Lecture Notes in Computer Science 2409, Springer 2002, ISBN 3-540-43977-3 [contents] - 2001
- [j30]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) - [j29]Sunil Arya, Siu-Wing Cheng
Approximation Algorithm for Multiple-Tool Milling. Int. J. Comput. Geom. Appl. 11(3): 339-372 (2001) - [j28]Michael Murphy, David M. Mount, Carl W. Gable
A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. Int. J. Comput. Geom. Appl. 11(6): 669-682 (2001) - [j27]David M. Mount
Approximating large convolutions in digital images. IEEE Trans. Image Process. 10(12): 1826-1835 (2001) - [c37]Songrit Maneewongvatana, David M. Mount:
An Empirical Study of a New Approach to Nearest Neighbor Searching. ALENEX 2001: 172-187 - [c36]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 - [c35]Sunil Arya, Theocharis Malamatos, David M. Mount:
Entropy-preserving cuttings and space-efficient planar point location. SODA 2001: 256-261 - [c34]Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. SODA 2001: 262-268 - [c33]Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan:
Algorithms for facility location problems with outliers. SODA 2001: 642-651 - [c32]Songrit Maneewongvatana, David M. Mount:
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. WADS 2001: 276-286 - 2000
- [j26]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) - [j25]Sunil Arya, David M. Mount:
Approximate range searching. Comput. Geom. 17(3-4): 135-152 (2000) - [j24]J. Mark Keil, David M. Mount, Stephen K. Wismath:
Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. Int. J. Comput. Geom. Appl. 10(5): 535-552 (2000) - [j23]David M. Mount, Nathan S. Netanyahu, Christine D. Piatko
Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. Int. J. Comput. Geom. Appl. 10(6): 593-608 (2000) - [c31]Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko
The analysis of a simple k-means clustering algorithm. SCG 2000: 100-109 - [c30]Sunil Arya, Theocharis Malamatos, David M. Mount:
Nearly Optimal Expected-Case Planar Point Location. FOCS 2000: 208-218 - [c29]Michael Murphy, David M. Mount, Carl W. Gable:
A point-placement strategy for conforming Delaunay tetrahedralization. SODA 2000: 67-74 - [c28]Sunil Arya, Siu-Wing Cheng
Efficient Expected-Case Algorithms for Planar Point Location. SWAT 2000: 353-366
1990 – 1999
- 1999
- [j22]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) - [j21]David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne:
Efficient algorithms for robust feature matching. Pattern Recognit. 32(1): 17-38 (1999) - [c27]David M. Mount, Fan-Tao Pu:
Binary Space Partitions in Plücker Space. ALENEX 1999: 94-113 - [c26]Songrit Maneewongvatana, David M. Mount:
Analysis of approximate nearest neighbor searching with clustered point sets. Data Structures, Near Neighbor Searches, and Methodology 1999: 105-123 - [c25]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 - [i1]Songrit Maneewongvatana, David M. Mount:
Analysis of approximate nearest neighbor searching with clustered point sets. CoRR cs.CG/9901013 (1999) - 1998
- [j20]Jirí Matousek, David M. Mount, Nathan S. Netanyahu:
Efficient Randomized Algorithms for the Repeated Median Line Estimator. Algorithmica 20(2): 136-150 (1998) - [j19]Sunil Arya, David M. Mount
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. J. ACM 45(6): 891-923 (1998) - [c24]David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
Quantile approximation for robust statistical estimation. CCCG 1998 - [c23]David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne:
Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. SCG 1998: 155-164 - [c22]Sunil Arya, Siu-Wing Cheng
Approximation Algorithms for Multiple-Tool Miling. SCG 1998: 297-306 - 1997
- [j18]Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg
Testing Simple Polygons. Comput. Geom. 8: 97-114 (1997) - [j17]Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis:
Parallelizing and Algorithm for Visibility on Polyhedral Terrain. Int. J. Comput. Geom. Appl. 7(1/2): 75-84 (1997) - [j16]Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
Query-Sensitive Ray Shooting. Int. J. Comput. Geom. Appl. 7(4): 317-347 (1997) - [c21]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 - 1996
- [j15]David M. Mount, Ruth Silverman, Angela Y. Wu:
On the Area of Overlap of Translated Polygons. Comput. Vis. Image Underst. 64(1): 53-61 (1996) - [j14]Sunil Arya, David M. Mount, Onuttom Narayan:
Accounting for Boundary Effects in Nearest-Neighbor Searching. Discret. Comput. Geom. 16(2): 155-176 (1996) - 1995
- [c20]Sunil Arya, David M. Mount:
Approximate Range Searching. SCG 1995: 172-181 - [c19]Sunil Arya, David M. Mount, Onuttom Narayan:
Accounting for Boundary Effects in Nearest Neighbor Searching. SCG 1995: 336-344 - [c18]Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 - 1994
- [j13]David M. Mount, Nathan S. Netanyahu:
Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP Graph. Model. Image Process. 56(4): 289-303 (1994) - [c17]Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
Query-Sensitive Ray Shooting. SCG 1994: 359-368 - [c16]Sunil Arya, David M. Mount, Michiel H. M. Smid:
Randomized and deterministic algorithms for geometric spanners of small diameter. FOCS 1994: 703-712 - [c15]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 - 1993
- [j12]Rajeev Sharma, David M. Mount, Yiannis Aloimonos:
Probabilistic analysis of some navigation strategies in a dynamic environment. IEEE Trans. Syst. Man Cybern. 23(5): 1465-1474 (1993) - [c14]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 - [c13]David M. Mount, Nathan S. Netanyahu:
Efficient Algorithms for Robust Circular Arc Estimators. CCCG 1993: 79-84 - [c12]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-392 - [c11]Sunil Arya, David M. Mount:
Algorithms for Fast Vector Quantizaton. Data Compression Conference 1993: 381-390 - [c10]Jirí Matousek, David M. Mount, Nathan S. Netanyahu:
Efficient Randomized Algorithms for the Repeated Median Line Estimator. SODA 1993: 74-82 - [c9]Sunil Arya, David M. Mount:
Approximate Nearest Neighbor Queries in Fixed Dimensions. SODA 1993: 271-280 - [c8]Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko
Point Probe Decision Trees for Geometric Concept Classes. WADS 1993: 95-106 - 1992
- [j11]Sharat Chandran, Sung Kwon Kim, David M. Mount:
Parallel Computational Geometry of Rectangles. Algorithmica 7(1): 25-49 (1992) - [j10]Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu:
A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. 2(1): 1-27 (1992) - [j9]Sharat Chandran, David M. Mount:
A parallel algorithm for enclosed and enclosing triangles. Int. J. Comput. Geom. Appl. 2(2): 191-214 (1992) - [c7]David M. Mount:
Intersection Detection and Separators for Simple Polygons. SCG 1992: 303-311 - 1991
- [j8]Saibal Banerjee, David M. Mount, Azriel Rosenfeld:
Pyramid computation of neighbor distance statistics in dot patterns. CVGIP Graph. Model. Image Process. 53(4): 373-381 (1991) - [j7]Subir Kumar Ghosh, David M. Mount:
An Output-Sensitive Algorithm for Computing Visibility Graphs. SIAM J. Comput. 20(5): 888-910 (1991) - 1990
- [j6]David M. Mount, Ruth Silverman:
Packing and Covering the Plane with Translates of a Convex Polygon. J. Algorithms 11(4): 564-580 (1990) - [j5]David M. Mount:
The Number of Shortest Paths on the Surface of a Polyhedron. SIAM J. Comput. 19(4): 593-611 (1990) - [c6]David M. Mount:
The Densest Double-Lattice Packing of a Convex Polygon. Discrete and Computational Geometry 1990: 245-262
1980 – 1989
- 1988
- [j4]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) - [c5]David M. Mount, Alan Saalfeld:
Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. SCG 1988: 143-152 - 1987
- [j3]T. Yung Kong, David M. Mount, Michael Werman:
The decomposition of a square into rectangles of minimal perimeter. Discret. Appl. Math. 16(3): 239-243 (1987) - [j2]David M. Mount:
Storing the Subdivision of a Polyhedral Surface. Discret. Comput. Geom. 2: 153-174 (1987) - [j1]Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou:
The Discrete Geodesic Problem. SIAM J. Comput. 16(4): 647-668 (1987) - [c4]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 - [c3]Subir Kumar Ghosh, David M. Mount:
An Output Sensitive Algorithm for Computing Visibility Graphs. FOCS 1987: 11-19 - 1986
- [c2]David M. Mount:
Storing the Subdivision of a Polyhedral Surface. SCG 1986: 150-158 - 1983
- [b1]David M. Mount:
Graph spectra and isomorphism testing. Purdue University, USA, 1983 - 1982
- [c1]László Babai
Isomorphism of Graphs with Bounded Eigenvalue Multiplicity. STOC 1982: 310-324
Coauthor Index
[j60] [c97] [c94] [i24] [i23] [i20] [i19] [j59] [c88] [c84] [i9] [j54] [c83] [i8] [j53] [c81] [c79] [i7] [c77] [c76] [i6] [i5] [i4] [c74] [j47] [c70] [c68] [c67] [c66] [c64] [j44] [j43] [c59] [c58] [j38] [j37] [c54] [c50] [c48] [r1] [c39] [j29] [c35] [c34] [j25] [c30] [c28] [j22] [j19] [c22] [j14] [c20] [c19] [c18] [c16] [c15] [c11] [c9]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: