School of Computing Science
Simon Fraser University
Burnaby, British Columbia, Canada
B.Sc. Honours/IIP (1998-2003)
Department of Computing Science
University of Alberta
Edmonton, Alberta, Canada
Broadly speaking, I'm interested in geometric methods for real-time rendering and illumination. Specifically, I've focused on geometric silhouette algorithms. My first interest is finding and updating these silhouettes efficiently on various classes of models; my second, applying silhouette information to other geometry problems.
It has been shown that in the worst case, a polygon mesh with n faces can have silhouettes of O(n) complexity, but also that under reasonable restrictions the average silhouette complexity is O(sqrt(n)). This tells us that efficient silhouette algorithms are interesting: for most meshes, we can beat brute-force approaches in asymptotic complexity as well as running time. Existing algorithms (including one of my own) work on static meshes, but animated or dynamic meshes are much more challenging (and therefore quite interesting).
Silhouettes are inextricably related to visibility information, which makes them useful for solving a broad class of geometry problems. I'm mostly interested in problems related to the silhouettes themselves, but when applications -- such as viewpoint selection -- pop up, I'm happy to address them.