David M. Mount

213 papers A* 35A 11B 11C 3Misc 3Journal 98Unranked 47

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Cauchy's Surface Area Formula in the Funk Geometry. CoRR Sunil Arya, David M. Mount
2026	J	`jnl`	Classifiers in High Dimensional Hilbert Metrics. CoRR Aditya Acharya, Auguste H. Gezalyan, David M. Mount
2026	J	`jnl`	On Voronoi diagrams in the Funk Conical Geometry. CoRR Aditya Acharya, Auguste H. Gezalyan, David M. Mount, Danesh Sivakumar
2026	J	`jnl`	On the Duality of Coverings in Hilbert Geometry. CoRR Sunil Arya, David M. Mount
2026	J	`jnl`	Optimal Area-Sensitive Bounds for Polytope Approximation. Discret. Comput. Geom. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2026	J	`jnl`	Proximity Alert: Ipelets for Neighborhood Graphs and Clustering. CoRR Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan, Danesh Sivakumar, Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, David M. Mount
2026	J	`jnl`	Visualizing Higher Order Structures, Overlap Regions, and Clustering in the Hilbert Geometry. CoRR Hridhaan Banerjee, Soren Brown, June Cagan, Auguste H. Gezalyan, Megan Hunleth, Veena Kailad, Chaewoon Kyoung, Rowan Shigeno, Yasmine Tajeddin, Andrew Wagger, Kelin Zhu, David M. Mount
2025	—	`conf`	Approximating Metric Depth Queries. CCCG Shuhao Tan, David M. Mount
2025	—	`conf`	Computational Geometry from a Non-Euclidean Perspective. CCCG David M. Mount
2025	A*	`conf`	Differentiable Approximations for Distance Queries. SODA Ahmed Abdelkader, David M. Mount
2025	B	`conf`	Evolving Distributions Under Local Motion. WADS Aditya Acharya, David M. Mount
2025	A*	`conf`	French Onion Soup, Ipelets for Points and Polygons (Media Exposition). SoCG Klint Faber, Auguste H. Gezalyan, Adam Martinson, Aniruddh Mutnuru, Nithin Parepally, Ryan Parker, Mihil Sreenilayam, Aram Zaprosyan, David M. Mount
2025	J	`jnl`	French Onion Soup, Ipelets for Points and Polygons. CoRR Klint Faber, Auguste H. Gezalyan, Adam Martinson, Aniruddh Mutnuru, Nithin Parepally, Ryan Parker, Mihil Sreenilayam, Aram Zaprosyan, David M. Mount
2025	J	`jnl`	Optimal Volume-Sensitive Bounds for Polytope Approximation. Discret. Comput. Geom. Sunil Arya, David M. Mount
2025	A*	`conf`	Software for the Thompson and Funk Polygonal Geometry (Media Exposition). SoCG Hridhaan Banerjee, Carmen Isabel Day, Auguste H. Gezalyan, Olga Golovatskaia, Megan Hunleth, Sarah Hwang, Nithin Parepally, Lucy Wang, David M. Mount
2025	J	`jnl`	Software for the Thompson and Funk Polygonal Geometry. CoRR Hridhaan Banerjee, Carmen Isabel Day, Auguste H. Gezalyan, Olga Golovatskaia, Megan Hunleth, Sarah Hwang, Nithin Parepally, Lucy Wang, David M. Mount
2025	B	`conf`	Support Vector Machines in the Hilbert Geometry. WADS Aditya Acharya, Auguste H. Gezalyan, Julian Vanecek, David M. Mount, Sunil Arya
2024	—	`conf`	Convex Approximation and the Hilbert Geometry. SOSA Ahmed Abdelkader, David M. Mount
2024	—	`conf`	Delaunay Triangulations in the Hilbert Metric. SWAT Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount
2024	J	`jnl`	Economical Convex Coverings and Applications. SIAM J. Comput. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2024	J	`jnl`	Evolving Distributions Under Local Motion. CoRR Aditya Acharya, David M. Mount
2024	A*	`conf`	Ipelets for the Convex Polygonal Geometry (Media Exposition). SoCG Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, David M. Mount
2024	J	`jnl`	Ipelets for the Convex Polygonal Geometry. CoRR Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, David M. Mount
2024	J	`jnl`	On Efficient Shortest Path Computation on Terrain Surface: A Direction-Oriented Approach. IEEE Trans. Knowl. Data Eng. Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M. Mount, Hanan Samet
2024	J	`jnl`	On The Heine-Borel Property and Minimum Enclosing Balls. CoRR Hridhaan Banerjee, Carmen Isabel Day, Megan Hunleth, Sarah Hwang, Auguste H. Gezalyan, Olga Golovatskaia, Nithin Parepally, Lucy Wang, David M. Mount
2023	J	`jnl`	Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	J	`jnl`	Delaunay Triangulations in the Hilbert Metric. CoRR Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount
2023	A*	`conf`	Economical Convex Coverings and Applications. SODA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	J	`jnl`	Economical Convex Coverings and Applications. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	J	`jnl`	Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	A*	`conf`	Optimal Volume-Sensitive Bounds for Polytope Approximation. SoCG Sunil Arya, David M. Mount
2023	J	`jnl`	Optimal Volume-Sensitive Bounds for Polytope Approximation. CoRR Sunil Arya, David M. Mount
2023	A	`conf`	Smooth Distance Approximation. ESA Ahmed Abdelkader, David M. Mount
2023	J	`jnl`	Smooth Distance Approximation. CoRR Ahmed Abdelkader, David M. Mount
2023	—	`conf`	Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. CCCG Auguste H. Gezalyan, Madeline Bumpus, Xufeng Dai, Sam Muñoz, Renita Santhoshkumar, Songyu Ye, David M. Mount
2023	J	`jnl`	Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. CoRR Madeline Bumpus, Xufeng Caesar Dai, Auguste H. Gezalyan, Sam Muñoz, Renita Santhoshkumar, Songyu Ye, David M. Mount
2023	J	`jnl`	Tracking Evolving labels using Cone based Oracles. CoRR Aditya Acharya, David M. Mount
2023	A*	`conf`	Voronoi Diagrams in the Hilbert Metric. SoCG Auguste H. Gezalyan, David M. Mount
2022	—	`conf`	Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CCCG Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
2022	J	`jnl`	Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CoRR Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
2022	J	`jnl`	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2022	—	`conf`	Optimally Confining Lattice Polymers. CCCG Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
2022	—	`conf`	Optimally Tracking Labels on an Evolving Tree. CCCG Aditya Acharya, David M. Mount
2022	J	`jnl`	Optimally Tracking Labels on an Evolving Tree. CoRR Aditya Acharya, David M. Mount
2022	J	`jnl`	Proximity Queries on Terrain Surface. ACM Trans. Database Syst. Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M. Mount, Hanan Samet
2021	J	`jnl`	A PTAS for the Min-Max Euclidean Multiple TSP. CoRR Mary Monroe, David M. Mount
2021	A*	`conf`	Approximate Nearest-Neighbor Search for Line Segments. SoCG Ahmed Abdelkader, David M. Mount
2021	J	`jnl`	Approximate Nearest-Neighbor Search for Line Segments. CoRR Ahmed Abdelkader, David M. Mount
2021	A	`conf`	Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. ESA Alejandro Flores-Velazco, David M. Mount
2021	J	`jnl`	Guarantees on nearest-neighbor condensation heuristics. Comput. Geom. Alejandro Flores-Velazco, David M. Mount
2021	J	`jnl`	Voronoi Diagrams in the Hilbert Metric. CoRR Auguste H. Gezalyan, David M. Mount
2020	A	`conf`	Coresets for the Nearest-Neighbor Rule. ESA Alejandro Flores-Velazco, David M. Mount
2020	J	`jnl`	Coresets for the Nearest-Neighbor Rule. CoRR Alejandro Flores-Velazco, David M. Mount
2020	A*	`conf`	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2019	A*	`conf`	Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2019	J	`jnl`	Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions. Comput. Geom. F. Betül Atalay, David M. Mount
2019	—	`conf`	Guarantees on Nearest-Neighbor Condensation heuristics. CCCG Alejandro Flores-Velazco, David M. Mount
2019	J	`jnl`	Guarantees on Nearest-Neighbor Condensation heuristics. CoRR Alejandro Flores-Velazco, David M. Mount
2019	J	`jnl`	Modular Circulation and Applications to Traffic Management. Algorithmica Philip Dasler, David M. Mount
2019	—	`conf`	New Directions in Approximate Nearest-Neighbor Searching. CALDAM David M. Mount
2019	B	`conf`	Online Algorithms for Warehouse Management. ISAAC Philip Dasler, David M. Mount
2019	J	`jnl`	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	A	`conf`	Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	J	`jnl`	Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	J	`jnl`	Approximate Polytope Membership Queries. SIAM J. Comput. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	—	`conf`	Economical Delone Sets for Approximating Convex Bodies. SWAT Ahmed Abdelkader, David M. Mount
2017	—	`conf`	Distance Oracle on Terrain Surface. SIGMOD Conference Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M. Mount
2017	B	`conf`	Modular Circulation and Applications to Traffic Management. WADS Philip Dasler, David M. Mount
2017	A*	`conf`	Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	J	`jnl`	Near-Optimal ε-Kernel Construction and Related Problems. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	J	`jnl`	On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	A*	`conf`	Optimal Approximate Polytope Membership. SODA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	A*	`conf`	A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. SODA Sunil Arya, David M. Mount
2016	J	`jnl`	A practical approximation algorithm for the LTS estimator. Comput. Stat. Data Anal. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Angela Y. Wu, Ruth Silverman
2016	J	`jnl`	Approximate Polytope Membership Queries. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	A*	`conf`	On the Combinatorial Complexity of Approximating Polytopes. SoCG Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	J	`jnl`	On the Combinatorial Complexity of Approximating Polytopes. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	J	`jnl`	Optimal Approximate Polytope Membership. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	J	`jnl`	Space Exploration via Proximity Search. Discret. Comput. Geom. Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
2015	J	`jnl`	A sensor-based framework for kinetic data compression. Comput. Geom. Sorelle A. Friedler, David M. Mount
2015	A*	`conf`	Approximate Geometric MST Range Queries. SoCG Sunil Arya, David M. Mount, Eunhui Park
2015	B	`conf`	On the Complexity of an Unregulated Traffic Crossing. WADS Philip Dasler, David M. Mount
2015	J	`jnl`	On the Complexity of an Unregulated Traffic Crossing. CoRR Philip Dasler, David M. Mount
2015	A*	`conf`	Space Exploration via Proximity Search. SoCG Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
2014	—	`conf`	A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets. CCCG Prayaag Venkat, David M. Mount
2014	J	`jnl`	On the Least Trimmed Squares Estimator. Algorithmica David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2014	J	`jnl`	Space Exploration via Proximity Search. CoRR Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel
2013	—	`conf`	Output-sensitive well-separated pair decompositions for dynamic point sets. SIGSPATIAL/GIS Eunhui Park, David M. Mount
2012	A	`conf`	A Self-adjusting Data Structure for Multidimensional Point Sets. ESA Eunhui Park, David M. Mount
2012	—	`conf`	Optimal area-sensitive bounds for polytope approximation. SCG Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2012	J	`jnl`	Optimal uniformly monotone partitioning of polygons with holes. Comput. Aided Des. Xiangzhi Wei, Ajay Joneja, David M. Mount
2012	A*	`conf`	Polytope approximation and the Mahler volume. SODA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2012	J	`jnl`	Tight Lower Bounds for Halfspace Range Searching. Discret. Comput. Geom. Sunil Arya, David M. Mount, Jian Xia
2011	A*	`conf`	Approximate polytope membership queries. STOC Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2011	—	`ch.`	New approaches to robust, point-based image registration. Image Registration for Remote Sensing David M. Mount, Nathan S. Netanyahu, San Ratanasanya
2010	—	`conf`	A Unified Approach to Approximate Proximity Searching. ESA (1) Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2010	—	`conf`	A dynamic data structure for approximate range searching. SCG David M. Mount, Eunhui Park
2010	J	`jnl`	Approximate range searching: The absolute model. Comput. Geom. Guilherme Dias da Fonseca, David M. Mount
2010	J	`jnl`	Approximation algorithm for the kinetic robust K-center problem. Comput. Geom. Sorelle A. Friedler, David M. Mount
2010	—	`conf`	Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. ESA (1) Sorelle A. Friedler, David M. Mount
2010	—	`conf`	Tight lower bounds for halfspace range searching. SCG Sunil Arya, David M. Mount, Jian Xia
2009	C	`conf`	Compressing Kinetic Data from Sensor Networks. ALGOSENSORS Sorelle A. Friedler, David M. Mount
2009	B	`conf`	Maintaining Nets and Net Trees under Incremental Motion. ISAAC Minkyoung Cho, David M. Mount, Eunhui Park
2009	J	`jnl`	Space-time tradeoffs for approximate nearest neighbor searching. J. ACM Sunil Arya, Theocharis Malamatos, David M. Mount
2009	J	`jnl`	The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. Sunil Arya, Theocharis Malamatos, David M. Mount
2008	—	`conf`	Embedding and similarity search for point sets under translation. SCG Minkyoung Cho, David M. Mount
2008	J	`jnl`	Improved Approximation Bounds for Planar Point Pattern Matching. Algorithmica Minkyoung Cho, David M. Mount
2008	A	`conf`	Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia
2008	—	`conf`	Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2007	J	`jnl`	A Fast Implementation of the Isodata Clustering Algorithm. Int. J. Comput. Geom. Appl. Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
2007	J	`jnl`	A practical approximation algorithm for the LMS line estimator. Comput. Stat. Data Anal. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
2007	J	`jnl`	A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms Sunil Arya, Theocharis Malamatos, David M. Mount
2007	Misc	`conf`	Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. International Conference on Computational Science (2) Nargess Memarsadeghi, David M. Mount
2007	J	`jnl`	Optimal Expected-Case Planar Point Location. SIAM J. Comput. Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong
2007	J	`jnl`	Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. Int. J. Comput. Geom. Appl. F. Betül Atalay, David M. Mount
2006	C	`conf`	Image Fusion Using Cokriging. IGARSS Nargess Memarsadeghi, Jacqueline Le Moigne, David M. Mount
2006	—	`conf`	Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data. ICASSP (5) Jacqueline Le Moigne, Arlene A. Cole-Rhodes, Roger D. Eastman, Peyush Jain, Aimee Joshua, Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jeffrey T. Morisette, Ezinne Uko-Ozoro
2006	—	`conf`	Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. CCCG David M. Mount
2006	A	`conf`	Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. ALENEX David M. Mount
2006	J	`jnl`	On the Least Median Square Problem. Discret. Comput. Geom. Jeff Erickson, Sariel Har-Peled, David M. Mount
2006	A*	`conf`	On the importance of idempotence. STOC Sunil Arya, Theocharis Malamatos, David M. Mount
2006	J	`jnl`	Proximity problems on line segments spanned by points. Comput. Geom. Ovidiu Daescu, Jun Luo, David M. Mount
2006	—	`conf`	The Cost of Compatible Refinement of Simplex Decomposition Trees. IMR F. Betül Atalay, David M. Mount
2006	—	`conf`	The effect of corners on the complexity of approximate range searching. SCG Sunil Arya, Theocharis Malamatos, David M. Mount
2005	J	`jnl`	Editorial. Comput. Geom. David M. Mount
2005	B	`conf`	Improved Approximation Bounds for Planar Point Pattern Matching. WADS Minkyoung Cho, David M. Mount
2005	—	`conf`	Proximity Problems on Line Segments Spanned by Points. CCCG Ovidiu Daescu, Jun Luo, David M. Mount
2005	A*	`conf`	Space-time tradeoffs for approximate spherical range counting. SODA Sunil Arya, Theocharis Malamatos, David M. Mount
2004	—	`conf`	A computational framework for incremental motion. SCG David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2004	J	`jnl`	A local search approximation algorithm for k-means clustering. Comput. Geom. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2004	—	`ch.`	Computational Geometry. Handbook of Data Structures and Applications Sunil Arya, David M. Mount
2004	—	`book`	Data structures and algorithms in C++. Michael T. Goodrich, Roberto Tamassia, David M. Mount
2004	—	`ch.`	Geometric Intersection. Handbook of Discrete and Computational Geometry, 2nd Ed. David M. Mount
2004	—	`conf`	On the least median square problem. SCG Jeff Erickson, Sariel Har-Peled, David M. Mount
2004	—	`conf`	Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. IMR F. Betül Atalay, David M. Mount
2004	B	`conf`	The ABCs of AVDs: Geometric Retrieval Made Simple. ISAAC David M. Mount
2003	C	`conf`	A fast implementation of the ISOCLUS algorithm. IGARSS Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
2003	A	`conf`	Interpolation over Light Fields with Applications in Computer Graphics. ALENEX F. Betül Atalay, David M. Mount
2002	—	`conf`	A local search approximation algorithm for k-means clustering. SCG Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2002	A	`ed.`	Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers ALENEX David M. Mount, Clifford Stein
2002	J	`jnl`	Algorithmic issues in modeling motion. ACM Comput. Surv. 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
2002	J	`jnl`	An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Trans. Pattern Anal. Mach. Intell. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2002	Misc	`conf`	Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. WSCG (Short Papers) F. Betül Atalay, David M. Mount
2002	A*	`conf`	Space-efficient approximate Voronoi diagrams. STOC Sunil Arya, Theocharis Malamatos, David M. Mount
2001	J	`jnl`	A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. Int. J. Comput. Geom. Appl. Michael Murphy, David M. Mount, Carl W. Gable
2001	A*	`conf`	A simple entropy-based algorithm for planar point location. SODA Sunil Arya, Theocharis Malamatos, David M. Mount
2001	A*	`conf`	Algorithms for facility location problems with outliers. SODA Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
2001	A	`conf`	An Empirical Study of a New Approach to Nearest Neighbor Searching. ALENEX Songrit Maneewongvatana, David M. Mount
2001	J	`jnl`	Approximating large convolutions in digital images. IEEE Trans. Image Process. David M. Mount, Tapas Kanungo, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2001	J	`jnl`	Approximation Algorithm for Multiple-Tool Milling. Int. J. Comput. Geom. Appl. Sunil Arya, Siu-Wing Cheng, David M. Mount
2001	J	`jnl`	Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Comput. Geom. David M. Mount, Nathan S. Netanyahu
2001	A*	`conf`	Entropy-preserving cuttings and space-efficient planar point location. SODA Sunil Arya, Theocharis Malamatos, David M. Mount
2001	Misc	`conf`	On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions. International Conference on Computational Science (1) Songrit Maneewongvatana, David M. Mount
2001	B	`conf`	The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. WADS Songrit Maneewongvatana, David M. Mount
2000	A*	`conf`	A point-placement strategy for conforming Delaunay tetrahedralization. SODA Michael Murphy, David M. Mount, Carl W. Gable
2000	J	`jnl`	Approximate range searching. Comput. Geom. Sunil Arya, David M. Mount
2000	J	`jnl`	Chromatic nearest neighbor searching: A query sensitive approach. Comput. Geom. David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
2000	—	`conf`	Efficient Expected-Case Algorithms for Planar Point Location. SWAT Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan
2000	A*	`conf`	Nearly Optimal Expected-Case Planar Point Location. FOCS Sunil Arya, Theocharis Malamatos, David M. Mount
2000	J	`jnl`	Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. Int. J. Comput. Geom. Appl. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2000	—	`conf`	The analysis of a simple SCG Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
2000	J	`jnl`	Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. Int. J. Comput. Geom. Appl. J. Mark Keil, David M. Mount, Stephen K. Wismath
1999	J	`jnl`	Analysis of approximate nearest neighbor searching with clustered point sets CoRR Songrit Maneewongvatana, David M. Mount
1999	—	`conf`	Analysis of approximate nearest neighbor searching with clustered point sets. Data Structures, Near Neighbor Searches, and Methodology Songrit Maneewongvatana, David M. Mount
1999	A	`conf`	Binary Space Partitions in Plücker Space. ALENEX David M. Mount, Fan-Tao Pu
1999	A*	`conf`	Computing Nearest Neighbors for Moving Points and Applications to Clustering. SODA Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
1999	J	`jnl`	Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. Sunil Arya, David M. Mount, Michiel H. M. Smid
1999	J	`jnl`	Efficient algorithms for robust feature matching. Pattern Recognit. David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
1998	J	`jnl`	An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. J. ACM Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
1998	—	`conf`	Approximation Algorithms for Multiple-Tool Miling. SCG Sunil Arya, Siu-Wing Cheng, David M. Mount
1998	J	`jnl`	Efficient Randomized Algorithms for the Repeated Median Line Estimator. Algorithmica Jirí Matousek, David M. Mount, Nathan S. Netanyahu
1998	—	`conf`	Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. SCG David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
1998	—	`conf`	Quantile approximation for robust statistical estimation. CCCG David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
1997	A*	`conf`	A Practical Approximation Algorithm for the LMS Line Estimator. SODA David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
1997	J	`jnl`	Parallelizing and Algorithm for Visibility on Polyhedral Terrain. Int. J. Comput. Geom. Appl. Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis
1997	J	`jnl`	Query-Sensitive Ray Shooting. Int. J. Comput. Geom. Appl. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
1997	J	`jnl`	Testing Simple Polygons. Comput. Geom. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
1996	J	`jnl`	Accounting for Boundary Effects in Nearest-Neighbor Searching. Discret. Comput. Geom. Sunil Arya, David M. Mount, Onuttom Narayan
1996	J	`jnl`	On the Area of Overlap of Translated Polygons. Comput. Vis. Image Underst. David M. Mount, Ruth Silverman, Angela Y. Wu
1995	—	`conf`	Accounting for Boundary Effects in Nearest Neighbor Searching. SCG Sunil Arya, David M. Mount, Onuttom Narayan
1995	—	`conf`	Approximate Range Searching. SCG Sunil Arya, David M. Mount
1995	A*	`conf`	Euclidean spanners: short, thin, and lanky. STOC Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
1994	A*	`conf`	An Optimal Algorithm for Approximate Nearest Neighbor Searching. SODA Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
1994	J	`jnl`	Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP Graph. Model. Image Process. David M. Mount, Nathan S. Netanyahu
1994	—	`conf`	Query-Sensitive Ray Shooting. SCG Joseph S. B. Mitchell, David M. Mount, Subhash Suri
1994	A*	`conf`	Randomized and deterministic algorithms for geometric spanners of small diameter FOCS Sunil Arya, David M. Mount, Michiel H. M. Smid
1993	B	`conf`	Algorithms for Fast Vector Quantizaton. Data Compression Conference Sunil Arya, David M. Mount
1993	A*	`conf`	Approximate Nearest Neighbor Queries in Fixed Dimensions. SODA Sunil Arya, David M. Mount
1993	—	`conf`	Efficient Algorithms for Robust Circular Arc Estimators. CCCG David M. Mount, Nathan S. Netanyahu
1993	A*	`conf`	Efficient Randomized Algorithms for the Repeated Median Line Estimator. SODA Jirí Matousek, David M. Mount, Nathan S. Netanyahu
1993	—	`conf`	On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. CCCG Michael B. Dillencourt, David M. Mount, Alan Saalfeld
1993	B	`conf`	Point Probe Decision Trees for Geometric Concept Classes. WADS Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena
1993	J	`jnl`	Probabilistic analysis of some navigation strategies in a dynamic environment. IEEE Trans. Syst. Man Cybern. Rajeev Sharma, David M. Mount, Yiannis Aloimonos
1993	—	`conf`	Testing Simple Polygons. CCCG Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
1992	J	`jnl`	A parallel algorithm for enclosed and enclosing triangles. Int. J. Comput. Geom. Appl. Sharat Chandran, David M. Mount
1992	J	`jnl`	A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu
1992	—	`conf`	Intersection Detection and Separators for Simple Polygons. SCG David M. Mount
1992	J	`jnl`	Parallel Computational Geometry of Rectangles. Algorithmica Sharat Chandran, Sung Kwon Kim, David M. Mount
1991	J	`jnl`	An Output-Sensitive Algorithm for Computing Visibility Graphs. SIAM J. Comput. Subir Kumar Ghosh, David M. Mount
1991	J	`jnl`	Pyramid computation of neighbor distance statistics in dot patterns. CVGIP Graph. Model. Image Process. Saibal Banerjee, David M. Mount, Azriel Rosenfeld
1990	J	`jnl`	Packing and Covering the Plane with Translates of a Convex Polygon. J. Algorithms David M. Mount, Ruth Silverman
1990	—	`conf`	The Densest Double-Lattice Packing of a Convex Polygon. Discrete and Computational Geometry David M. Mount
1990	J	`jnl`	The Number of Shortest Paths on the Surface of a Polyhedron. SIAM J. Comput. David M. Mount
1988	—	`conf`	Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. SCG David M. Mount, Alan Saalfeld
1988	J	`jnl`	The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. SIAM J. Comput. T. Yung Kong, David M. Mount, A. W. Roscoe
1987	—	`conf`	Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. ACM Conference on Computer Science David M. Mount, Ruth Silverman
1987	A*	`conf`	An Output Sensitive Algorithm for Computing Visibility Graphs FOCS Subir Kumar Ghosh, David M. Mount
1987	J	`jnl`	Storing the Subdivision of a Polyhedral Surface. Discret. Comput. Geom. David M. Mount
1987	J	`jnl`	The Discrete Geodesic Problem. SIAM J. Comput. Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou
1987	J	`jnl`	The decomposition of a square into rectangles of minimal perimeter. Discret. Appl. Math. T. Yung Kong, David M. Mount, Michael Werman
1986	—	`conf`	Storing the Subdivision of a Polyhedral Surface. SCG David M. Mount
1983	—	`—`	Graph spectra and isomorphism testing David M. Mount
1982	A*	`conf`	Isomorphism of Graphs with Bounded Eigenvalue Multiplicity STOC László Babai, D. Yu. Grigoryev, David M. Mount