paper

Computational Geometry Column 35

arXiv:cs/9906023

Abstract

The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.