Session 37 Computational Geometry V

1:30 PM-2:50 PM
Room: Liberty A
Chair: Bernard Moret, University of New Mexico, Albuquerque

1:30-1:47 Shortest Paths in an Arrangement with k Line Orientations: David Eppstein and David W. Hart, University of California, Irvine
1:50-2:07 Moved to Session 22
An Efficient Algorithm for Computing the ith Letter of ⁿ(a): Jeffrey Shallit and David Swart, University of Waterloo, Canada
2:10-2:27 Locked and Unlocked Polygonal Chains in 3D

T. Biedl, S. Lazard, S. Robbins, G. Toussaint and S. Whitesides, McGill University, Montreal, Canada; Erik D. Demaine, Martin L. Demaine and Anna Lubiw, University of Waterloo, Canada; J. O'Rourke, Smith College; M. Overmars, Utrecht University, The Netherlands; and I. Streinu, Smith College
2:30-2:47 Fast and Effective Stripification of Polygonal Surface Models: Xinyu Xiang, Martin Held, and Joseph S. B. Mitchell, State University of New York, Stony Brook

tjf, 9/14/98, MMD, 11/28/98