Date: | June 29th, 2005 |
Location: | DC1304 |
Time: | 2:30 PM |
Chair: | ![]() Shawn Morel |
Date: | June 29st | July 6th | July 13th | July 20th |
Location: | DC1304 | DC1304 | DC1304 | DC1304 |
Chair: | ![]() Gabriel Moreno |
![]() Kevin Moule |
![]() Zheng Qin |
![]() Mauro Steigleder |
Technical Presentation: |
![]() Michael McCool |
![]() Shawn Morel |
![]() Gabriel Moreno |
![]() Kevin Moule |
![]() Stephen Mann
|
Title: Proving the Lane-Riesenfeld Algorithm Abstract:
The Lane-Riesenfeld algorithm inserts knots half-way between existing
knots. It's advantages are that it inserts a group of knots at once,
and it is simple to program. In this talk, I present some work of Ron
Goldman, who gave a blossoming proof of correctness for this algorithm.
|