John E. Hershberger
Author, editor, or reviewer of:
- An optimal algorithm for Euclidean shortest paths in the plane
- Data structures for two-edge connectivity in planar graphs
- Deformable free space tilings for kinetic collision detection
- Efficient computation of Euclidean shortest paths in the plane
- Erased arrangements of lines and convex decompositions of polyhedra
- Finding the $k$ shortest simple paths: a new algorithm and its implementation
- Fully dynamic 2-edge-connectivity in planar graphs
- Geometric spanner for routing in mobile networks
- Kinetic collision detection between simple polygons
- Kinetic connectivity of rectangles
- Maintaining the extent of a geometric point set
- On the difficulty of some shortest path problems
- Selecting heavily covered points
- Smooth kinetic maintenance of clusters
- The centroid of points with approximate weights
- Vickrey prices and shortest paths: what is an edge worth?
