J. Mitchell

Publications
Influence

J. Mitchell, D. Mount, C. Papadimitriou
Mathematics, Computer Science
SIAM J. Comput.
1 August 1987

We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. Expand

An efficiently computable metric for comparing polygonal shapes

E. Arkin, L. Chew, D. Huttenlocher, K. Kedem, J. Mitchell
Mathematics, Computer Science
SODA '90
1 March 1991

We use the L2 metric on the turning functions of polygons as a way to implement the intuitive notion of shape-resemblance. Expand

The weighted region problem: finding shortest paths through a weighted planar subdivision

J. Mitchell, C. Papadimitriou
Mathematics, Computer Science
JACM
3 January 1991

The problem of determining shortest paths through a weighted planar polygonal subdivision with n vertices is considered. Expand

Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs

J. Klosowski, M. Held, J. Mitchell, H. Sowizral, K. Zikan
Computer Science
IEEE Trans. Vis. Comput. Graph.
1998

We have proposed a method for efficient collision detection among polygonal models, based on a bounding volume hierarchy (BV-tree) whose bounding volumes are kdops. Expand

Approximation algorithms for TSP with neighborhoods in the plane

A. Dumitrescu, J. Mitchell
Mathematics, Computer Science
SODA '01
9 January 2001

In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. Expand

Boundary recognition in sensor networks by topological methods

Yue Wang, Jie Gao, J. Mitchell
Computer Science
MobiCom '06
29 September 2006

We study the problem of topology discovery, in particular, identifying boundaries in a sensor network. Expand

Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

J. Mitchell
Computer Science, Mathematics
SIAM J. Comput.
1 March 1999

We show that any polygonal subdivision in the plane can be converted into an "m-guillotine" subdivision whose length is at most $(1+{c\over m})$ times that of the original subdivision, for a small constant c. Expand

Touring a sequence of polygons

M. Dror, A. Efrat, A. Lubiw, J. Mitchell
Mathematics, Computer Science
STOC '03
9 June 2003

We give the first polynomial-time algorithm for the general touring polygons problem: to find a shortest path, between two specified points, that visits in order a sequence of k possibly intersecting convex polygons. Expand

Shortest paths among obstacles in the plane

J. Mitchell
Mathematics, Computer Science
SCG '93
1 July 1993

We give a subquadratic time and space algorithm for computing Euclidean shortest paths in the plane in the presence of polygonal obstacles; previous time bounds were at least quadratic in the worst-case. Expand

Approximate minimum enclosing balls in high dimensions using core-sets

P. Kumar, J. Mitchell, E. A. Yildirim
Computer Science, Mathematics
JEAL
31 December 2003

We study the minimum enclosing ball (MEB) problem for sets of points or balls in high dimensions. Expand

Recommended Authors