Pixel Club: Robust Computational Geometry and Graphics

Elisha Sacks (Purdue University)
Tuesday, 7.5.2013, 11:30
EE Meyer Building 1061

Computational geometry has developed efficient algorithms for a range of tasks that could benefit computer graphics. Yet the practical application of these algorithms is limited. One explanation is that the algorithms are correct and efficient based on a theoretical analysis in the real-RAM model, whereas graphics requires software that is reliable and efficient in practice. This so called robustness problem has been attacked in several ways. I will describe our solution, adaptive-precision controlled perturbation, and discuss my ongoing research on robust algorithms for computing visibility in time-varying and multi-viewpoint scenes.

joint work with: Victor Milenkovic, University of Miami

Back to the index of events