# Computational Geometry Seminar

### Fall 2014- Spring 2015

### Tuesdays 13:10 - 15:00, Location: Kaplun 319

click on the title to view the lecture abstract

### Seminar

>Date |
Speaker & Affiliation |
Title Of Talk |
---|---|---|

28.10 | Efi Fogel, TAU | CGAL and CGAL Arrangements |

4.11 | Maxim Orlov | Drupal |

11.11 | Michal Kleinbort, TAU |
An expected O(n log n) time verification algorithm for the longest point-location search path |

2.12 | Kiril Solovey, TAU | PSPACE-hardness of unlabeled motion planning and variants |

9.12 | Michal Kleinbort, TAU | Efficient all-pairs k-nearest-neighbor search for sampling based motion planning algorithms |

14.12 | Doron Shaharabani, TAU (a joint session with Micha's seminar) | The offset filtration of convex objects |

23.12 |
Michael Hemmer, Braunschweig Technical University | Recent Developments in CGAL --- Minkowski Sums and More |

6.1 | Oren Salzman, TAU | Motion-Planning for Multi-Linked Robots by Harnessing the Structure of the Configuration Space |

27.1 | Michal Kleinbort, TAU | The role of nearest-neighbor search in sampling based motion-planning algorithms |

Link for 2014 : Computational Geometry Seminar

Dan Halperin | ||

Gilit Zohar Oren |