• Publications
  • Influence
The Discrete Geodesic Problem
TLDR
We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. Expand
  • 643
  • 75
  • PDF
An efficiently computable metric for comparing polygonal shapes
TLDR
We use the L2 metric on the turning functions of polygons as a way to implement the intuitive notion of shape-resemblance. Expand
  • 740
  • 42
  • PDF
The weighted region problem: finding shortest paths through a weighted planar subdivision
TLDR
The problem of determining shortest paths through a weighted planar polygonal subdivision with n vertices is considered. Expand
  • 333
  • 42
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
TLDR
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
  • 905
  • 39
  • PDF
Approximation algorithms for TSP with neighborhoods in the plane
TLDR
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
  • 243
  • 37
  • PDF
Boundary recognition in sensor networks by topological methods
  • Yue Wang, Jie Gao, J. Mitchell
  • Computer Science
  • MobiCom '06
  • 29 September 2006
TLDR
We study the problem of topology discovery, in particular, identifying boundaries in a sensor network. Expand
  • 405
  • 28
  • PDF
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
TLDR
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
  • 420
  • 24
  • PDF
Touring a sequence of polygons
TLDR
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
  • 133
  • 21
  • PDF
Shortest paths among obstacles in the plane
  • J. Mitchell
  • Mathematics, Computer Science
  • SCG '93
  • 1 July 1993
TLDR
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
  • 152
  • 17
Approximate minimum enclosing balls in high dimensions using core-sets
TLDR
We study the minimum enclosing ball (MEB) problem for sets of points or balls in high dimensions. Expand
  • 163
  • 15
  • PDF