Wednesday, June 14

Combinatorial Geometry - Part I of II

10:30 am - 12:30 pm
Room: Section A
For Part II, See MS10.

Combinatorial geometry deals with questions of enumeration and existence of geometric objects, like triangulations, sets of line segments, polytopes, packings, coverings etc. These subjects have always been the subject of investigations of classical combinatorialists. In recent decades, results from combinatorial geometry have found the bases for the design and analysis of algorithms in computational geometry. The relevance of combinatorial geometry extends to other branches of mathematics like graph theory (e.g. graph drawing), operations research (e.g. packing and covering problems). This minisymposium will highlight some of the recent achievments in combinatorial geometry.

Organizers: Pavel Valtr
Charles University, Czech Republic
Günter Rote
Freie Universität Berlin, Germany
10:30 - 10:55 Cancelled Geometric Permutations
Meir Katchalski, Technion-Israel Institute of Technology, Israel
11:00 - 11:25 Perspectives on Isoperimetry, and Fejes Toth's Dido Problem
Alan Siegel
11:30 - 11:55 Equitable Partitions of Lines
Bill Steiger, Rutgers University, USA
12:00- 12:25 Geometric Graphs: Ramses-type and Turan-type Problems
Pavel Valtr, Charles University, Czech Republic

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 6/18/00