Isomorphism of Graphs with Bounded Eigenvalue Multiplicity - László Babai; D. Yu. Grigoryev; David M. Mount (STOC, 1982)

Graph spectra and isomorphism testing - David M. Mount (1983)

Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. - David M. Mount; Ruth Silverman (ACM Conference on Computer Science, 1987)

The decomposition of a square into rectangles of minimal perimeter. - T. Yung Kong; David M. Mount; Michael Werman (Discret. Appl. Math., 1987)

Storing the Subdivision of a Polyhedral Surface. - David M. Mount (Discret. Comput. Geom., 1987)

The Discrete Geodesic Problem. - Joseph S. B. Mitchell; David M. Mount; Christos H. Papadimitriou (SIAM J. Comput., 1987)

Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. - David M. Mount; Alan Saalfeld (SCG, 1988)

The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. - T. Yung Kong; David M. Mount; A. W. Roscoe 001 (SIAM J. Comput., 1988)

The Densest Double-Lattice Packing of a Convex Polygon. - David M. Mount (Discrete and Computational Geometry, 1990)

Packing and Covering the Plane with Translates of a Convex Polygon. - David M. Mount; Ruth Silverman (J. Algorithms, 1990)

The Number of Shortest Paths on the Surface of a Polyhedron. - David M. Mount (SIAM J. Comput., 1990)

Pyramid computation of neighbor distance statistics in dot patterns. - Saibal Banerjee; David M. Mount; Azriel Rosenfeld (CVGIP Graph. Model. Image Process., 1991)

An Output-Sensitive Algorithm for Computing Visibility Graphs. - Subir Kumar Ghosh; David M. Mount (SIAM J. Comput., 1991)

Intersection Detection and Separators for Simple Polygons. - David M. Mount (SCG, 1992)

Parallel Computational Geometry of Rectangles. - Sharat Chandran; Sung Kwon Kim; David M. Mount (Algorithmica, 1992)

A parallel algorithm for enclosed and enclosing triangles. - Sharat Chandran; David M. Mount (Int. J. Comput. Geom. Appl., 1992)

A randomized algorithm for slope selection. - Michael B. Dillencourt; David M. Mount; Nathan S. Netanyahu (Int. J. Comput. Geom. Appl., 1992)

On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. - Michael B. Dillencourt; David M. Mount; Alan Saalfeld (CCCG, 1993)

Efficient Algorithms for Robust Circular Arc Estimators. - David M. Mount; Nathan S. Netanyahu (CCCG, 1993)

Algorithms for Fast Vector Quantizaton. - Sunil Arya; David M. Mount (Data Compression Conference, 1993)

Approximate Nearest Neighbor Queries in Fixed Dimensions. - Sunil Arya; David M. Mount (SODA, 1993)

Point Probe Decision Trees for Geometric Concept Classes. - Esther M. Arkin; Michael T. Goodrich; Joseph S. B. Mitchell; David M. Mount; Christine D. Piatko; Steven Skiena (WADS, 1993)

Probabilistic analysis of some navigation strategies in a dynamic environment. - Rajeev Sharma; David M. Mount; Yiannis Aloimonos (IEEE Trans. Syst. Man Cybern., 1993)

Randomized and deterministic algorithms for geometric spanners of small diameter - Sunil Arya; David M. Mount; Michiel H. M. Smid (FOCS, 1994)

An Optimal Algorithm for Approximate Nearest Neighbor Searching. - Sunil Arya; David M. Mount; Nathan S. Netanyahu; Ruth Silverman; Angela Y. Wu (SODA, 1994)

Computationally Efficient Algorithms for High-Dimensional Robust Estimators. - David M. Mount; Nathan S. Netanyahu (CVGIP Graph. Model. Image Process., 1994)

Euclidean spanners: short, thin, and lanky. - Sunil Arya; Gautam Das 001; David M. Mount; Jeffrey S. Salowe; Michiel H. M. Smid (STOC, 1995)

On the Area of Overlap of Translated Polygons. - David M. Mount; Ruth Silverman; Angela Y. Wu (Comput. Vis. Image Underst., 1996)

Accounting for Boundary Effects in Nearest-Neighbor Searching. - Sunil Arya; David M. Mount; Onuttom Narayan (Discret. Comput. Geom., 1996)

Testing Simple Polygons. - Esther M. Arkin; Patrice Belleville; Joseph S. B. Mitchell; David M. Mount; Kathleen Romanik; Steven Salzberg; Diane L. Souvaine (Comput. Geom., 1997)

Query-Sensitive Ray Shooting. - Joseph S. B. Mitchell; David M. Mount; Subhash Suri (Int. J. Comput. Geom. Appl., 1997)

Parallelizing and Algorithm for Visibility on Polyhedral Terrain. - Y. Ansel Teng; David M. Mount; Enrico Puppo; Larry S. Davis (Int. J. Comput. Geom. Appl., 1997)

Quantile approximation for robust statistical estimation. - David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (CCCG, 1998)

Approximation Algorithms for Multiple-Tool Miling. - Sunil Arya; Siu-Wing Cheng; David M. Mount (SCG, 1998)

Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. - David M. Mount; Nathan S. Netanyahu; Jacqueline Le Moigne (SCG, 1998)

Efficient Randomized Algorithms for the Repeated Median Line Estimator. - Jirí Matousek 001; David M. Mount; Nathan S. Netanyahu (Algorithmica, 1998)

An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. - Sunil Arya; David M. Mount; Nathan S. Netanyahu; Ruth Silverman; Angela Y. Wu (J. ACM, 1998)

Binary Space Partitions in Plücker Space. - David M. Mount; Fan-Tao Pu (ALENEX, 1999)

Analysis of approximate nearest neighbor searching with clustered point sets. - Songrit Maneewongvatana; David M. Mount (Data Structures, Near Neighbor Searches, and Methodology, 1999)

Computing Nearest Neighbors for Moving Points and Applications to Clustering. - Tapas Kanungo; David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (SODA, 1999)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. - Sunil Arya; David M. Mount; Michiel H. M. Smid (Comput. Geom., 1999)

Efficient algorithms for robust feature matching. - David M. Mount; Nathan S. Netanyahu; Jacqueline Le Moigne (Pattern Recognit., 1999)

The analysis of a simple k-means clustering algorithm. - Tapas Kanungo; David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (SCG, 2000)

Nearly Optimal Expected-Case Planar Point Location. - Sunil Arya; Theocharis Malamatos; David M. Mount (FOCS, 2000)

Efficient Expected-Case Algorithms for Planar Point Location. - Sunil Arya; Siu-Wing Cheng; David M. Mount; Ramesh Hariharan (SWAT, 2000)

Approximate range searching. - Sunil Arya; David M. Mount (Comput. Geom., 2000)

Chromatic nearest neighbor searching: A query sensitive approach. - David M. Mount; Nathan S. Netanyahu; Ruth Silverman; Angela Y. Wu (Comput. Geom., 2000)

Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. - J. Mark Keil; David M. Mount; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2000)

Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. - David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (Int. J. Comput. Geom. Appl., 2000)

An Empirical Study of a New Approach to Nearest Neighbor Searching. - Songrit Maneewongvatana; David M. Mount (ALENEX, 2001)

On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions. - Songrit Maneewongvatana; David M. Mount (International Conference on Computational Science (1), 2001)

Entropy-preserving cuttings and space-efficient planar point location. - Sunil Arya; Theocharis Malamatos; David M. Mount (SODA, 2001)

Algorithms for facility location problems with outliers. - Moses Charikar; Samir Khuller; David M. Mount; Giri Narasimhan (SODA, 2001)

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. - Songrit Maneewongvatana; David M. Mount (WADS, 2001)

Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. - David M. Mount; Nathan S. Netanyahu (Comput. Geom., 2001)

Approximation Algorithm for Multiple-Tool Milling. - Sunil Arya; Siu-Wing Cheng; David M. Mount (Int. J. Comput. Geom. Appl., 2001)

A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. - Michael Murphy; David M. Mount; Carl W. Gable (Int. J. Comput. Geom. Appl., 2001)

Approximating large convolutions in digital images. - David M. Mount; Tapas Kanungo; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (IEEE Trans. Image Process., 2001)

Space-efficient approximate Voronoi diagrams. - Sunil Arya; Theocharis Malamatos; David M. Mount (STOC, 2002)

Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. - F. Betül Atalay; David M. Mount (WSCG (Short Papers), 2002)

Algorithmic issues in modeling motion. - Pankaj K. Agarwal; Leonidas J. Guibas; Herbert Edelsbrunner; Jeff Erickson 001; Michael Isard; Sariel Har-Peled; John Hershberger 001; Christian S. Jensen; Lydia E. Kavraki; Patrice Koehl; Ming C. Lin; Dinesh Manocha; et al. (ACM Comput. Surv., 2002)

An Efficient k-Means Clustering Algorithm: Analysis and Implementation. - Tapas Kanungo; David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (IEEE Trans. Pattern Anal. Mach. Intell., 2002)

Interpolation over Light Fields with Applications in Computer Graphics. - F. Betül Atalay; David M. Mount (ALENEX, 2003)

A fast implementation of the ISOCLUS algorithm. - Nargess Memarsadeghi; David M. Mount; Nathan S. Netanyahu; Jacqueline Le Moigne (IGARSS, 2003)

Data structures and algorithms in C++. - Michael T. Goodrich; Roberto Tamassia; David M. Mount (Wiley, 2004)

A computational framework for incremental motion. - David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (SCG, 2004)

The ABCs of AVDs: Geometric Retrieval Made Simple. - David M. Mount (ISAAC, 2004)

A local search approximation algorithm for k-means clustering. - Tapas Kanungo; David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (Comput. Geom., 2004)

Geometric Intersection. - David M. Mount (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Computational Geometry. - Sunil Arya; David M. Mount (Handbook of Data Structures and Applications, 2004)

Space-time tradeoffs for approximate spherical range counting. - Sunil Arya; Theocharis Malamatos; David M. Mount (SODA, 2005)

Editorial. - David M. Mount (Comput. Geom., 2005)

Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. - David M. Mount (ALENEX, 2006)

Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. - David M. Mount (CCCG, 2006)

Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data. - 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 (ICASSP (5), 2006)

Image Fusion Using Cokriging. - Nargess Memarsadeghi; Jacqueline Le Moigne; David M. Mount (IGARSS, 2006)

The Cost of Compatible Refinement of Simplex Decomposition Trees. - F. Betül Atalay; David M. Mount (IMR, 2006)

On the importance of idempotence. - Sunil Arya; Theocharis Malamatos; David M. Mount (STOC, 2006)

Proximity problems on line segments spanned by points. - Ovidiu Daescu; Jun Luo 008; David M. Mount (Comput. Geom., 2006)

On the Least Median Square Problem. - Jeff Erickson 001; Sariel Har-Peled; David M. Mount (Discret. Comput. Geom., 2006)

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. - Nargess Memarsadeghi; David M. Mount (International Conference on Computational Science (2), 2007)

A practical approximation algorithm for the LMS line estimator. - David M. Mount; Nathan S. Netanyahu; Kathleen Romanik; Ruth Silverman; Angela Y. Wu (Comput. Stat. Data Anal., 2007)

Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. - F. Betül Atalay; David M. Mount (Int. J. Comput. Geom. Appl., 2007)

A Fast Implementation of the Isodata Clustering Algorithm. - Nargess Memarsadeghi; David M. Mount; Nathan S. Netanyahu; Jacqueline Le Moigne (Int. J. Comput. Geom. Appl., 2007)

Optimal Expected-Case Planar Point Location. - Sunil Arya; Theocharis Malamatos; David M. Mount; Ka Chun Wong (SIAM J. Comput., 2007)

A simple entropy-based algorithm for planar point location. - Sunil Arya; Theocharis Malamatos; David M. Mount (ACM Trans. Algorithms, 2007)

Embedding and similarity search for point sets under translation. - Minkyoung Cho; David M. Mount (SCG, 2008)

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. - Sunil Arya; David M. Mount; Antoine Vigneron; Jian Xia (ESA, 2008)

Tradeoffs in Approximate Range Searching Made Simpler. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SIBGRAPI, 2008)

Improved Approximation Bounds for Planar Point Pattern Matching. - Minkyoung Cho; David M. Mount (Algorithmica, 2008)

Compressing Kinetic Data from Sensor Networks. - Sorelle A. Friedler; David M. Mount (ALGOSENSORS, 2009)

Maintaining Nets and Net Trees under Incremental Motion. - Minkyoung Cho; David M. Mount; Eunhui Park (ISAAC, 2009)

The Effect of Corners on the Complexity of Approximate Range Searching. - Sunil Arya; Theocharis Malamatos; David M. Mount (Discret. Comput. Geom., 2009)

Space-time tradeoffs for approximate nearest neighbor searching. - Sunil Arya; Theocharis Malamatos; David M. Mount (J. ACM, 2009)

A dynamic data structure for approximate range searching. - David M. Mount; Eunhui Park (SCG, 2010)

A Unified Approach to Approximate Proximity Searching. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (ESA (1), 2010)

Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. - Sorelle A. Friedler; David M. Mount (ESA (1), 2010)

Approximate range searching: The absolute model. - Guilherme Dias da Fonseca; David M. Mount (Comput. Geom., 2010)

Approximation algorithm for the kinetic robust K-center problem. - Sorelle A. Friedler; David M. Mount (Comput. Geom., 2010)

New approaches to robust, point-based image registration. - David M. Mount; Nathan S. Netanyahu; San Ratanasanya (Image Registration for Remote Sensing, 2011)

Optimal area-sensitive bounds for polytope approximation. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SCG, 2012)

A Self-adjusting Data Structure for Multidimensional Point Sets. - Eunhui Park; David M. Mount (ESA, 2012)

Polytope approximation and the Mahler volume. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SODA, 2012)

Optimal uniformly monotone partitioning of polygons with holes. - Xiangzhi Wei; Ajay Joneja; David M. Mount (Comput. Aided Des., 2012)

Tight Lower Bounds for Halfspace Range Searching. - Sunil Arya; David M. Mount; Jian Xia (Discret. Comput. Geom., 2012)

Output-sensitive well-separated pair decompositions for dynamic point sets. - Eunhui Park; David M. Mount (SIGSPATIAL/GIS, 2013)

A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets. - Prayaag Venkat; David M. Mount (CCCG, 2014)

On the Least Trimmed Squares Estimator. - David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Ruth Silverman; Angela Y. Wu (Algorithmica, 2014)

Approximate Geometric MST Range Queries. - Sunil Arya; David M. Mount; Eunhui Park (SoCG, 2015)

On the Complexity of an Unregulated Traffic Crossing. - Philip Dasler; David M. Mount (WADS, 2015)

A sensor-based framework for kinetic data compression. - Sorelle A. Friedler; David M. Mount (Comput. Geom., 2015)

A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. - Sunil Arya; David M. Mount (SODA, 2016)

A practical approximation algorithm for the LTS estimator. - David M. Mount; Nathan S. Netanyahu; Christine D. Piatko; Angela Y. Wu; Ruth Silverman (Comput. Stat. Data Anal., 2016)

Space Exploration via Proximity Search. - Sariel Har-Peled; Nirman Kumar; David M. Mount; Benjamin Raichel (Discret. Comput. Geom., 2016)

Near-Optimal epsilon-Kernel Construction and Related Problems. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SoCG, 2017)

Distance Oracle on Terrain Surface. - Victor Junqiu Wei; Raymond Chi-Wing Wong; Cheng Long 001; David M. Mount (SIGMOD Conference, 2017)

Optimal Approximate Polytope Membership. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SODA, 2017)

Near-Optimal ε-Kernel Construction and Related Problems. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (CoRR, 2017)

On the Combinatorial Complexity of Approximating Polytopes. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (Discret. Comput. Geom., 2017)

Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (ESA, 2018)

Economical Delone Sets for Approximating Convex Bodies. - Ahmed Abdelkader; David M. Mount (SWAT, 2018)

Approximate Polytope Membership Queries. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SIAM J. Comput., 2018)

New Directions in Approximate Nearest-Neighbor Searching. - David M. Mount (CALDAM, 2019)

Online Algorithms for Warehouse Management. - Philip Dasler; David M. Mount (ISAAC, 2019)

Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. - Ahmed Abdelkader; Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SODA, 2019)

Modular Circulation and Applications to Traffic Management. - Philip Dasler; David M. Mount (Algorithmica, 2019)

Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions. - F. Betül Atalay; David M. Mount (Comput. Geom., 2019)

Coresets for the Nearest-Neighbor Rule. - Alejandro Flores-Velazco; David M. Mount (ESA, 2020)

Approximate Nearest-Neighbor Search for Line Segments. - Ahmed Abdelkader; David M. Mount (SoCG, 2021)

Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. - Alejandro Flores-Velazco; David M. Mount (ESA, 2021)

Guarantees on nearest-neighbor condensation heuristics. - Alejandro Flores-Velazco; David M. Mount (Comput. Geom., 2021)

A PTAS for the Min-Max Euclidean Multiple TSP. - Mary Monroe; David M. Mount (CoRR, 2021)

Optimally Tracking Labels on an Evolving Tree. - Aditya Acharya; David M. Mount (CCCG, 2022)

Optimally Confining Lattice Polymers. - Gill Barequet; Shion Fukuzawa; Michael T. Goodrich; David M. Mount; Martha C. Osegueda; Evrim Ozel (CCCG, 2022)

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. - Shion Fukuzawa; Michael T. Goodrich; David M. Mount; Martha C. Osegueda; Evrim Ozel (CCCG, 2022)

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. - Gill Barequet; Shion Fukuzawa; Michael T. Goodrich; David M. Mount; Martha C. Osegueda; Evrim Ozel (CoRR, 2022)

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. - Rahul Arya; Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (ACM Trans. Algorithms, 2022)

Proximity Queries on Terrain Surface. - Victor Junqiu Wei; Raymond Chi-Wing Wong; Cheng Long 001; David M. Mount; Hanan Samet (ACM Trans. Database Syst., 2022)

Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric. - Auguste H. Gezalyan; Madeline Bumpus; Xufeng Dai 001; Sam Muñoz; Renita Santhoshkumar; Songyu Ye; David M. Mount (CCCG, 2023)

Optimal Volume-Sensitive Bounds for Polytope Approximation. - Sunil Arya; David M. Mount (SoCG, 2023)

Voronoi Diagrams in the Hilbert Metric. - Auguste H. Gezalyan; David M. Mount (SoCG, 2023)

Smooth Distance Approximation. - Ahmed Abdelkader; David M. Mount (ESA, 2023)

Tracking Evolving labels using Cone based Oracles. - Aditya Acharya; David M. Mount (CoRR, 2023)

Ipelets for the Convex Polygonal Geometry (Media Exposition). - Nithin Parepally; Ainesh Chatterjee; Auguste H. Gezalyan; Hongyang Du; Sukrit Mangla; Kenny Wu; Sarah Hwang; David M. Mount (SoCG, 2024)

Convex Approximation and the Hilbert Geometry. - Ahmed Abdelkader; David M. Mount (SOSA, 2024)

Delaunay Triangulations in the Hilbert Metric. - Auguste H. Gezalyan; Soo Kim; Carlos Lopez; Daniel Skora; Zofia Stefankovic; David M. Mount (SWAT, 2024)

Ipelets for the Convex Polygonal Geometry. - Nithin Parepally; Ainesh Chatterjee; Auguste H. Gezalyan; Hongyang Du; Sukrit Mangla; Kenny Wu; Sarah Hwang; David M. Mount (CoRR, 2024)

On The Heine-Borel Property and Minimum Enclosing Balls. - Hridhaan Banerjee; Carmen Isabel Day; Megan Hunleth; Sarah Hwang; Auguste H. Gezalyan; Olga Golovatskaia; Nithin Parepally; Lucy Wang; David M. Mount (CoRR, 2024)

Economical Convex Coverings and Applications. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SIAM J. Comput., 2024)

On Efficient Shortest Path Computation on Terrain Surface: A Direction-Oriented Approach. - Victor Junqiu Wei; Raymond Chi-Wing Wong; Cheng Long 001; David M. Mount; Hanan Samet (IEEE Trans. Knowl. Data Eng., 2024)

Software for the Thompson and Funk Polygonal Geometry (Media Exposition). - Hridhaan Banerjee; Carmen Isabel Day; Auguste H. Gezalyan; Olga Golovatskaia; Megan Hunleth; Sarah Hwang; Nithin Parepally; Lucy Wang; David M. Mount (SoCG, 2025)

French Onion Soup, Ipelets for Points and Polygons (Media Exposition). - Klint Faber; Auguste H. Gezalyan; Adam Martinson; Aniruddh Mutnuru; Nithin Parepally; Ryan Parker; Mihil Sreenilayam; Aram Zaprosyan; David M. Mount (SoCG, 2025)

Differentiable Approximations for Distance Queries. - Ahmed Abdelkader; David M. Mount (SODA, 2025)

Support Vector Machines in the Hilbert Geometry. - Aditya Acharya; Auguste H. Gezalyan; Julian Vanecek; David M. Mount; Sunil Arya (WADS, 2025)

Evolving Distributions Under Local Motion. - Aditya Acharya; David M. Mount (WADS, 2025)

French Onion Soup, Ipelets for Points and Polygons. - Klint Faber; Auguste H. Gezalyan; Adam Martinson; Aniruddh Mutnuru; Nithin Parepally; Ryan Parker; Mihil Sreenilayam; Aram Zaprosyan; David M. Mount (CoRR, 2025)

Software for the Thompson and Funk Polygonal Geometry. - Hridhaan Banerjee; Carmen Isabel Day; Auguste H. Gezalyan; Olga Golovatskaia; Megan Hunleth; Sarah Hwang; Nithin Parepally; Lucy Wang; David M. Mount (CoRR, 2025)

Software For the Thompson and Funk Geometry. - Hridhaan Banerjee; Carmen Isabel Day; Auguste H. Gezalyan; Olga Golovatskaia; Megan Hunleth; Sarah Hwang; Nithin Parepally; Lucy Wang; David M. Mount (DROPS Artifacts, 2025)

Ipelets for Points and Polygons. - Klint Faber; Auguste H. Gezalyan; Adam Martinson; Aniruddh Mutnuru; Nithin Parepally; Ryan Parker; Mihil Sreenilayam; Aram Zaprosyan; David M. Mount (DROPS Artifacts, 2025)