
September
Su  Mo  Tu  We  Th  Fr  Sa 
1  2  3  4  5  6  7 
8  9  10  11  12  13  14 
15  16  17  18  19  20  21 
22  23  24  25  26  27  28 
29  30      

 Info
Computational Geometry Seminar
2016/2017
Wednesdays 16:10  18:00
Schreiber 309
Seminar
Date

Speaker & Affiliation

Title Of Talk

02.11.16

Paul Seiferth, FU Berlin 
Routing in unit disk graphs

09.11.16

Sariel HarPeled, UIUC 
Proximity in the age of distraction: Robust approximate nearest neighbor search

16.11.16

Omer Gold, TAU 
New bounds and relations for some basic geometric problems

23.11.16

Gershon Elber, The Technion 
Contacts

07.12.16

Michal Kleinbort, TAU 
Collision detection or nearestneighbor search? On the computational bottleneck in samplingbased motion planning

14.12.16

Kiril Solovey, TAU 
SamplingBased Bottleneck Pathfinding with Applications to Fréchet Matching

21.12.16

Adam Sheffer, CalTech 
Reductions for Distinct Distances Problems in R^d 
28.12.16

Esther Ezra, Georgia Tech 
A Nearly Quadratic Bound for the Decision Tree Complexity of kSUM 
04.01.17

Elisha Sacks, Purdue University 
Solid Modelling for VLSI Design

11.01.17

Boris Aronov, New York University 
Breaking depthorder cycles and other adventures in 3D

18.01.17

Efi Fogel, TAU

GIT primer

25.01.17

Tal Wagner, MIT 
Nearoptimal (Euclidean) metric compression 



08.02.17

Pankaj K. Agarwal, Duke University

Efficient Algorithms for Computing Transportation Maps 



15.03.17

Leonardo Martinez, BGU

Depth with respect to a family of convex sets

22.03.17

Henny Admony, CMU 
Toward Natural HumanRobot Collaboration 
29.03.17

Laszlo Kozma, TAU 
Maximum Scatter TSP in doubling metrics 
05.04.17 
Uri Grupel, Weizmann 
Random Sampling and the Vector in Subspace Problem

12.04.17 
Passover, no seminar 

03.05.17 
Dan Halperin, TAU 
Minkowski Sums of Polyhedra with Holes 
10.05.17 
Micha Sharir, TAU 
On Danzer's four points theorem 
17.05.17 
Aviel Atias, TAU 
Effective Metrics for MultiRobot Motion Planning 
24.05.17 
Nitzan Weissman, TAU 
The planar separator strikes back: exact, approximate and quasi polynomial algorithms 
31.05.17 
SHAVU'OT, no seminar 

14.06.17 
Chaya Keller, BGU 
ConflictFree Coloring of Intersection Graphs of Geometric Objects 
21.06.17 
Shay Mozes, IDC 
Voronoi diagrams, diameter and distance oracles for planar graphs 
*19.07.17* 
Noam Solomon, TAU 
Incidences & Co. (a love story between discrete objects) 
16.08.17 
Micha Sharir, TAU 
Near optimal algorithms in the linear decision tree model for kSUM and related problems: The KaneLovettMoran paper [slides] 
Link for 2016 Spring : Computational Geometry Seminar
Dan Halperin 


Gilit Zohar Oren 


