Handbook Discrete Computational Geometry G Toth, O'Rourke | 2533* | |

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 | 1259 | 1998 |

An efficiently computable metric for comparing polygonal shapes EM Arkin, LP Chew, DP Huttenlocher, K Kedem, JS Mitchell CORNELL UNIV ITHACA NY, 1991 | 968 | 1991 |

The discrete geodesic problem JSB Mitchell, DM Mount, CH Papadimitriou SIAM Journal on Computing 16 (4), 647-668, 1987 | 740 | 1987 |

Shortest path algorithms: an evaluation using real road networks FB Zhan, CE Noon Transportation science 32 (1), 65-73, 1998 | 700 | 1998 |

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, *k*-MST, and Related ProblemsJSB Mitchell SIAM Journal on computing 28 (4), 1298-1309, 1999 | 513 | 1999 |

Geometric Shortest Paths and Network Optimization. JSB Mitchell Handbook of computational geometry 334, 633-702, 2000 | 497 | 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 | 452 | 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 | 370 | 1991 |

Approximation algorithms for TSP with neighborhoods in the plane A Dumitrescu, JSB Mitchell Journal of Algorithms 48 (1), 135-159, 2003 | 280 | 2003 |

Approximation algorithms for lawn mowing and milling EM Arkin, SP Fekete, JSB Mitchell Computational Geometry 17 (1-2), 25-50, 2000 | 273 | 2000 |

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 | 226 | 1996 |

Evaluation of collision detection methods for virtual reality fly-throughs M Held, JT Klosowski, JSB Mitchell Canadian Conference on Computational Geometry, 205-210, 1995 | 215 | 1995 |

Shortest paths among obstacles in the plane JSB Mitchell International Journal of Computational Geometry & Applications 6 (03), 309-332, 1996 | 213 | 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 | 205 | 2005 |

An algorithmic approach to some problems in terrain navigation JSB Mitchell Artificial Intelligence 37 (1-3), 171-201, 1988 | 193 | 1988 |

Shortest paths and networks JSB Mitchell Handbook of discrete and computational geometry, 445-466, 1997 | 191 | 1997 |

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 | 180 | 2003 |

Approximation algorithms for geometric tour and network design problems CS Mata, JSB Mitchell Proceedings of the eleventh annual symposium on Computational geometry, 360-369, 1995 | 164 | 1995 |

*L* _{1} shortest paths among polygonal obstacles in the planeJSB Mitchell Algorithmica 8 (1-6), 55-88, 1992 | 160 | 1992 |