Home /  Workshop /  Schedules /  Computational complexity of stabbing, visibility and radii computations

Computational complexity of stabbing, visibility and radii computations

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

October 15, 2003 (11:00 AM PDT - 11:30 AM PDT)
Speaker(s): Thorsten Theobald
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

249-1680-Computational complexity of stabbing, visibility and radii computations-Thorsten Theobald
Abstract No Abstract Uploaded
Supplements
Asset no preview theobald.pdf 789 KB application/pdf Download
Video/Audio Files

249-1680-Computational complexity of stabbing, visibility and radii computations-Thorsten Theobald

H.264 Video 249-1680-Computational_complexity_of_stabbing__visibility_and_radii_computations-Thorsten_Theobald.mp4 31.4 MB video/mp4 Download
249-1680-Computational_complexity_of_stabbing__visibility_and_radii_computations-Thorsten_Theobald.rm 9.17 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.