We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
We review some recent progress in improving the speed of electron microscope tomography through highly parallel algorithms implemented on parallel computers, clusters and graphics...
This paper looks at existing computer games and virtual environments from the perspective of film theory and practice. From this, we will draw conclusions about the ways in which ...
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...