Techniques for interactive deformation of unstructured polygon meshes are of fundamental importance to a host of applications. Most traditional approaches to this problem have emp...
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
We present a method for interactive rendering of dynamic models with self-shadows due to time-varying, lowfrequency lighting environments. In contrast to previous techniques, the ...
We present a novel technique for direct visualization of unsteady flow on surfaces from computational fluid dynamics. The method generates dense representations of time-dependen...