My research area is theoretical Computer Science, focusing on efficient algorithms, their complexity and foundations of computation. This can be broadly applied to problems of geometry, algebra and topology. Application areas include robotics, graphics & visualization, and modeling. We are fundamentally interested in continuous computation (e.g., real numbers). The core difficulty is the Zero Problem, deciding if a computed quantity is actually zero. Traditionally, many theoreticians have assumed that for reliable computation, we must tackle this head-on (exact computation). Except for simple problems, this is neither feasible nor necessary. What we seek is to define suitable soft versions of a given exact problem and to provide algorithms with a priori guarantees. The key lies in interval computation and its generalizations. |

Page last modified on November 03, 2019, at 09:44 AM

PmWiki/Adapt/Yap2