Sunday, January 9

Session 1C

9:00 AM-10:40 AM
Room: Gold Rush B

9:00 An Optimal Algorithm for Hyperplane Depth in the Plane
Stefan Langerman and William Steiger, Rutgers University
9:25 On Heilbronn's Problem in Higher Dimension
Hanno Lefmann, Universität Dortmund, Germany
9:50 Finding Minimal Triangulations of Convex 3-Polytopes is NP-Hard
Alexander Below, ETH-Zurich, Switzerland; Jesús A. De Loera, University of California, Davis; and Jürgen Richter-Gebert, ETH-Zurich, Switzerland
10:15 A Point-Placement Strategy for Conforming Delaunay Tetrahedralization
Michael Murphy, University of Maryland, College Park and Los Alamos National Laboratory; David M. Mount, University of Maryland, College Park; and Carl W. Gable, Los Alamos National Laboratory

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99