Tuesday, January 11

Session 9B

9:00 AM-10:40 AM
Room: Oregon/Nevada

9:00 TSP-Based Curve Reconstruction in Polynomial Time

Ernst Althaus and Kurt Mehlhorn, Max-Planck-Institut für Informatik, Germany

9:25 A Tree-Edit-Distance Algorithm for Comparing Simple, Closed Shapes

Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, and Ben Kimia, Brown University

9:50 Computing the Arrangement of Curve Segments: Divide-and-Conquer Algorithms via Sampling

Nancy M. Amato, Texas A&M University; Michael T. Goodrich, Johns Hopkins University; and Edgar A. Ramos, Max-Planck-Institut für Informatik, Germany

10:15 Optimizing the Sum of Linear Fractional Functions and Applications

Danny Z. Chen and Ovidiu Daescu, University of Notre Dame; Yang Dai, Tokyo Institute of Technology, Japan; Naoki Katoh, Kyoto University, Japan; Xiaodong Wu and Jinhui Xu, University of Notre Dame