Computational Geometry Seminar

Wednesday, May 31st, 2006, 16:10-18:00

Room 309
Schreiber Building

On the Union of Fat Tetrahedra in Three Dimensions

Esther Ezra, Tel Aviv University

We show some initial results concerning the combinatorial complexity of the union of $n$ "fat" tetrahedra in $3$-space, having an arbitrary side length.
In our analysis we use "curve-sensitive cuttings", in order to reduce this problem to the problem of bounding the combinatorial complexity of the union of "fat" dihedral and trihedral wedges in $3$-space.

Joint work with Micha Sharir.