Most cited papers in Computational Geometry and Mesh Generation
What are the most cited papers in Computational Geometry and Mesh Generation?
The most cited paper in Computational Geometry and Mesh Generation is "UMAP: Uniform Manifold Approximation and Projection" (Leland McInnes, John Healy, Nathaniel Saul et al., 2018), with 10,200 citations. Next come "Gmsh: A 3‐D finite element mesh generator with built‐in pre‐ and post‐processing facilities" (7,914) and "The quickhull algorithm for convex hulls" (5,441).
Showing 50 of 98 papers. Every paper with more than 894 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | UMAP: Uniform Manifold Approximation and Projection Leland McInnes, John Healy, Nathaniel Saul et al. · The Journal of Open Source Software | 2 Sep 2018 | 10,200 |
| 2 | Gmsh: A 3‐D finite element mesh generator with built‐in pre‐ and post‐processing facilities Christophe Geuzaine, Jean‐François Remacle · International Journal for Numerical Methods in Engineering | 7 May 2009 | 7,914 |
| 3 | The quickhull algorithm for convex hulls C. Bradford Barber, David Dobkin, Hannu T. Huhdanpaa · ACM Transactions on Mathematical Software | Dec 1996 | 5,441 |
| 4 | A new polynomial-time algorithm for linear programming Narendra K. Karmarkar · COMBINATORICA | Dec 1984 | 4,858 |
| 5 | An analysis of approximations for maximizing submodular set functions—I George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher · Mathematical Programming | Dec 1978 | 4,553 |
| 6 | Computational Geometry: Algorithms and Applications Mark de Berg, Otfried Cheong, Marc J. van Kreveld et al. · CERN Document Server (European Organization for Nuclear Research) | 1997 | 4,503 |
| 7 | Voronoi diagrams—a survey of a fundamental geometric data structure Franz Aurenhammer · ACM Computing Surveys | Sep 1991 | 4,387 |
| 8 | Computational Geometry--An Introduction. Mikhail J. Atallah, Franco P. Preparata, Michael Ian Shamos · Mathematics of Computation | Oct 1986 | 4,274 |
| 9 | The R*-tree: an efficient and robust access method for points and rectangles Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. | May 1990 | 4,188 |
| 10 | Geometric Deep Learning: Going beyond Euclidean data Michael M. Bronstein, Joan Bruna, Yann LeCun et al. · IEEE Signal Processing Magazine | Jul 2017 | 3,748 |
| 11 | RRT-connect: An efficient approach to single-query path planning James Kuffner, Steven M. LaValle | 7 Nov 2002 | 3,525 |
| 12 | Surface simplification using quadric error metrics Michael J. Garland, Paul S. Heckbert | 1997 | 3,436 |
| 13 | A fast marching level set method for monotonically advancing fronts. James A. Sethian · Proceedings of the National Academy of Sciences | 20 Feb 1996 | 3,254 |
| 14 | A level set method for structural topology optimization Michael Yu Wang, Xiaoming Wang, Dongming Guo · Computer Methods in Applied Mechanics and Engineering | 27 Dec 2002 | 3,247 |
| 15 | A volumetric method for building complex models from range images Brian Curless, Marc Levoy | Aug 1996 | 3,171 |
| 16 | A threshold of ln n for approximating set cover Uriel Feige · Journal of the ACM | Jul 1998 | 3,149 |
| 17 | Progressive meshes Hugues Hoppe | Aug 1996 | 2,828 |
| 18 | A fast parallel algorithm for thinning digital patterns Tingwei Zhang, Ching Y. Suen · Communications of the ACM | Mar 1984 | 2,781 |
| 19 | Free-form deformation of solid geometric models Thomas W. Sederberg, Scott R. Parry · ACM SIGGRAPH Computer Graphics | 31 Aug 1986 | 2,599 |
| 20 | Three-dimensional alpha shapes Herbert Edelsbrunner, Ernst P. Mücke · ACM Transactions on Graphics | 1994 | 2,504 |
| 21 | An optimal algorithm for approximate nearest neighbor searching fixed dimensions Sunil Arya, David M. Mount, Nathan S. Netanyahu et al. · Journal of the ACM | Nov 1998 | 2,332 |
| 22 | An algorithm for planning collision-free paths among polyhedral obstacles Tomás Lozano‐Pérez, Michael A. Wesley · Communications of the ACM | Oct 1979 | 2,318 |
| 23 | Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator Jonathan Richard Shewchuk · Lecture notes in computer science | 1996 | 2,144 |
| 24 | OBBTree S. Gottschalk, Ming C. Lin, Dinesh Manocha | Aug 1996 | 2,082 |
| 25 | The ellipsoid method and its consequences in combinatorial optimization Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA | Jun 1981 | 2,059 |
| 26 | A Survey of General‐Purpose Computation on Graphics Hardware John D. Owens, David P. Luebke, Naga K. Govindaraju et al. · Computer Graphics Forum | Mar 2007 | 2,034 |
| 27 | Recursively generated B-spline surfaces on arbitrary topological meshes Edwin E. Catmull, J. Clark · Computer-Aided Design | Nov 1978 | 2,027 |
| 28 | Lipschitzian optimization without the Lipschitz constant Donald R. Jones, C.D. Perttunen, B.E. Stuckman · Journal of Optimization Theory and Applications | Oct 1993 | 2,008 |
| 29 | Mesh Free Methods: Moving Beyond the Finite Element Method GR Liu, Dimitrios Karamanlidis · Applied Mechanics Reviews | Mar 2003 | 1,933 |
| 30 | Discrete Differential-Geometry Operators for Triangulated 2-Manifolds Mark Meyer, Mathieu Desbrun, Peter Schröder et al. · Mathematics and visualization | 2003 | 1,906 |
| 31 | On the shape of a set of points in the plane Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel · IEEE Transactions on Information Theory | Jul 1983 | 1,886 |
| 32 | Algorithms in Combinatorial Geometry. Jacob Eli Goodman, Herbert Edelsbrunner · American Mathematical Monthly | May 1989 | 1,811 |
| 33 | Clustering to minimize the maximum intercluster distance Teofilo F. Gonzalez · Theoretical Computer Science | 1985 | 1,763 |
| 34 | Large steps in cloth simulation David Baraff, Andrew Witkin | 1998 | 1,700 |
| 35 | On the Encoding of Arbitrary Geometric Configurations Herbert Freeman · IEEE Transactions on Electronic Computers | Jun 1961 | 1,673 |
| 36 | TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator Hang Si · ACM Transactions on Mathematical Software | 4 Feb 2015 | 1,626 |
| 37 | Multidimensional access methods Volker Gaede, Oliver Günther · ACM Computing Surveys | Jun 1998 | 1,593 |
| 38 | Two algorithms for constructing a Delaunay triangulation D. T. Lee, Bruce J. Schachter · International Journal of Parallel Programming | Jun 1980 | 1,593 |
| 39 | New methods to color the vertices of a graph Daniel Brélaz · Communications of the ACM | Apr 1979 | 1,586 |
| 40 | A Simple Mesh Generator in MATLAB Per‐Olof Persson, Gilbert Strang · SIAM Review | 2004 | 1,577 |
| 41 | Graph minors. II. Algorithmic aspects of tree-width Neil R. Robertson, Paul D. Seymour · Journal of Algorithms | Sep 1986 | 1,566 |
| 42 | A fast procedure for computing the distance between complex objects in three-dimensional space Éric Gilbert, Daniel Johnson, S. Sathiya Keerthi · IEEE Journal on Robotics and Automation | Apr 1988 | 1,517 |
| 43 | The Geometries of 3-Manifolds Peter Scott · Bulletin of the London Mathematical Society | Sep 1983 | 1,508 |
| 44 | Metro: Measuring Error on Simplified Surfaces Paolo Cignoni, C. Rocchini, Roberto Scopigno · Computer Graphics Forum | Jun 1998 | 1,492 |
| 45 | Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes David F. Watson · The Computer Journal | Feb 1981 | 1,487 |
| 46 | Dispelling the N3 myth for the kt jet-finder Matteo Cacciari, Gavin P. Salam · Physics Letters B | 29 Aug 2006 | 1,477 |
| 47 | Decimation of triangle meshes W. J. Schroeder, Jonathan A. Zarge, William E. Lorensen | Jul 1992 | 1,470 |
| 48 | Unit disk graphs Brent N. Clark, Charles J. Colbourn, David Johnson · Discrete Mathematics | Dec 1990 | 1,446 |
| 49 | The plane with parallel coordinates Alfred Inselberg · The Visual Computer | Aug 1985 | 1,440 |
| 50 | Representations for Rigid Solids: Theory, Methods, and Systems Aristides G. Requicha · ACM Computing Surveys | Dec 1980 | 1,439 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.