On the number of congruent simplices in a point. Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Time Responsive External Data Structures for Moving Points. Indexing Moving Points. Exact and approximation algorithms for minimum-width cylindrical shells.
Approximation algorithms for layered manufacturing.
Approximation algorithms for projective clustering. Computing approximate shortest paths on convex polytopes. Efficient Searching with Linear Constraints. SIAM J. Comput. Approximating Shortest Paths on a Nonconvex Polyhedron.