Computational Geometry Seminar

Spring Semester 2006
Wednesdays, 16:10 - 18:00, Schreiber 309


Date

Speaker & Affiliation

Title of Talk

8.3

Elad Verbin, TAU

Colored Range Searching via Matrix Multiplication

15.3

 

CGAL Meeting

22.3

Ron Wein, TAU

Planning Near-Optimal Corridors Amidst Obstacles

29.3

Alfred Bruckstein, Technion

Outline for a Book on Digital Geometry

5.4

Eyal Ackerman, Technion

On the maximum number of edges in k-quasi-planar graphs

12.4

Pessach, no seminar

 

19.4

Pessach, no seminar

 

26.4

Efi Fogel, TAU

Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra

3.5

Yom Ha'Atzmaut, no seminar

 

10.5

Natan Rubin, TAU

Counting Colors in Boxes

17.5

Pankaj Agarwal, Duke University

I/O-efficient union-find and its applications in terrain modeling

24.5

Idit Haran, TAU

Efficient Point Location in General Planar Subdivision Using Landmarks

31.5

Esther Ezra, TAU

On the Union of Fat Tetrahedra in Three Dimensions

8.6 *

Eric Berberich, Max-Planck-Institut fur Informatik *

Exacus - A Detailed Overview

14.6

No Meeting

 

(*) - Please note that Eric Berberich's talk will be given on Thursday, between 18:30-19:30, at Schreiber 006