Sunday Afternoon, January 28, 1996
Sherwood Room
Session 4
Chair: David Eppstein, University of California, Irvine
- 2:00-2:20 Polynomial-Time Solutions to Image Segmentation
- Tetsuo Asano, Osaka Electro-Communication University, Japan; Danny Z. Chen, University of Notre Dame; Naoki Katoh, Kobe University of Commerce, Japan; and Takeshi Tokuyama, IBM Japan, Japan
- 2:25-2:45 Optimal Placement of Convex Polygons to Maximize Point Containment
- Matthew Dickerson, Middlebury College; and Daniel Scharstein, Cornell University
- 2:50-3:10 Efficient Generation of k-Directional Assembly Sequences
- Pankaj K. Agarwal, Duke University; Mark de Berg, Utrecht University, The Netherlands; Dan Halperin, Stanford University; and Micha Sharir, Tel-Aviv University, Israel
- 3:15-3:35 Fixed-Dimensional Parallel Linear Programming via Relative -Approximations
- Michael T. Goodrich, Johns Hopkins University
11/13/95