Department of Computer Science

Theory of Combinatorial Algorithms
Prof. Emo Welzl
up 
People
Activity Report
Previous Reports
Research
Mittagsseminar
Teaching
Workshops
Social Activities

Topics for Master / Bachelor Theses

CGAL Geometric Algorithms Library
  Mittagsseminar (in cooperation with A. Steger and B. Sudakov)

Talks by Jack Snoeyink

1998

    April

    • April 21, 1998, Jack Snoeyink (INRIA Sophia-Antipolis & Univ. of British Columbia): On the primitives required for efficient segment intersection algorithms [details]
    • April 23, 1998, Jack Snoeyink: An open problem on points and segments in the plane, and where it comes from [details]

    2007

    • April 10, 2007, Jack Snoeyink (Univ. of North Carolina at Chapel Hill): Questions for graph rigidity from modeling allostery [details]

    May

    • May 29, 2007, Jack Snoeyink (Univ. of North Carolina at Chapel Hill): Convex hulls of intersections of line segments and planes [details]


    Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

    Previous talks by year:   2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

    Information for students and suggested topics for student talks


    Automatic MiSe System Software Version 1.3900   |   admin login

    11-Jul-2013 / vincent-mise@inf.ethz.ch