| Handbook Discrete Computational Geometry G Toth, O'Rourke | 2988* | |
| Efficient collision detection using bounding volume hierarchies of k-DOPs JT Klosowski, M Held, JSB Mitchell, H Sowizral, K Zikan IEEE transactions on Visualization and Computer Graphics 4 (1), 21-36, 1998 | 1409 | 1998 |
| An efficiently computable metric for comparing polygonal shapes EM Arkin, LP Chew, DP Huttenlocher, K Kedem, JSB Mitchell Cornell University Operations Research and Industrial Engineering, 1989 | 1099 | 1989 |
| The discrete geodesic problem JSB Mitchell, DM Mount, CH Papadimitriou SIAM Journal on Computing 16 (4), 647-668, 1987 | 929 | 1987 |
| Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems JSB Mitchell SIAM Journal on computing 28 (4), 1298-1309, 1999 | 605 | 1999 |
| Geometric Shortest Paths and Network Optimization. JSB Mitchell Handbook of computational geometry 334, 633-702, 2000 | 540 | 2000 |
| Boundary recognition in sensor networks by topological methods Y Wang, J Gao, JSB Mitchell Proceedings of the 12th annual international conference on Mobile computing …, 2006 | 499 | 2006 |
| The weighted region problem: finding shortest paths through a weighted planar subdivision JSB Mitchell, CH Papadimitriou Journal of the ACM (JACM) 38 (1), 18-73, 1991 | 409 | 1991 |
| Approximation algorithms for lawn mowing and milling EM Arkin, SP Fekete, JSB Mitchell Computational Geometry 17 (1-2), 25-50, 2000 | 383 | 2000 |
| Approximation algorithms for TSP with neighborhoods in the plane A Dumitrescu, JSB Mitchell Journal of Algorithms 48 (1), 135-159, 2003 | 333 | 2003 |
| Shortest paths among obstacles in the plane JSB Mitchell Proceedings of the ninth annual symposium on Computational geometry, 308-317, 1993 | 248 | 1993 |
| BOXTREE: A hierarchical representation for surfaces in 3D G Barequet, B Chazelle, LJ Guibas, JSB Mitchell, A Tal Computer Graphics Forum 15 (3), 387-396, 1996 | 246 | 1996 |
| Approximation algorithms for two optimal location problems in sensor networks A Efrat, S Har-Peled, JSB Mitchell 2nd International Conference on Broadband Networks, 2005., 714-723, 2005 | 237 | 2005 |
| Evaluation of collision detection methods for virtual reality fly-throughs M Held, JT Klosowski, JSB Mitchell Canadian Conference on Computational Geometry, 205-210, 1995 | 231 | 1995 |
| Shortest paths and networks JSB Mitchell Handbook of discrete and computational geometry, 811-848, 2017 | 226 | 2017 |
| Approximate minimum enclosing balls in high dimensions using core-sets P Kumar, JSB Mitchell, EA Yildirim Journal of Experimental Algorithmics (JEA) 8, 1.1-es, 2003 | 216 | 2003 |
| An algorithmic approach to some problems in terrain navigation JSB Mitchell Artificial Intelligence 37 (1-3), 171-201, 1988 | 205 | 1988 |
| Touring a sequence of polygons M Dror, A Efrat, A Lubiw, JSB Mitchell Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 203 | 2003 |
| Hamiltonian triangulations for fast rendering EM Arkin, M Held, JSB Mitchell, SS Skiena The Visual Computer 12, 429-444, 1996 | 191 | 1996 |
| L1 shortest paths among polygonal obstacles in the plane JSB Mitchell Algorithmica 8 (1), 55-88, 1992 | 186 | 1992 |
