Home /  Workshop /  Schedules /  Complexity and computation of 3D Delaunay triangulations

Complexity and computation of 3D Delaunay triangulations

Mathematical Foundations of Geometric Algorithms October 13, 2003 - October 17, 2003

October 13, 2003 (10:30 AM PDT - 11:00 AM PDT)
Speaker(s): Annamaria Amenta (University of California, Davis)
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

10313

249-1667-Complexity and computation of 3D Delaunay triangulations-Nina Amenta
Abstract No Abstract Uploaded
Supplements
Asset no preview amenta.pdf 186 KB application/pdf Download
Video/Audio Files

10313

DVD Video 10313-10313-MPEG-2.m2v 805 MB video/mpeg Download
Audio 10313-10313-AIFF.aiff 153 MB audio/x-aiff Download
Quicktime 10313-10313-Quicktime.mov 198 MB video/quicktime rtsp://videos.msri.org/10313/10313-10313-Quicktime.mov Download
H.264 Video 10313-10313.mp4 161 MB video/mp4 Download

249-1667-Complexity and computation of 3D Delaunay triangulations-Nina Amenta

H.264 Video 249-1667-Complexity_and_computation_of_3D_Delaunay_triangulations-Nina_Amenta.mp4 25.3 MB video/mp4 Download
249-1667-Complexity_and_computation_of_3D_Delaunay_triangulations-Nina_Amenta.rm 10 MB application/vnd.rn-realmedia Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.