Abstract: The advent of GPGPU technologies has allowed for sensible speed-ups in many high-dimension, memory-intensive computational problems. In this paper we demonstrate the effectiveness of such techniques by describing two applications of GPGPU computing to two different subfields of computer graphics, namely computer vision and mesh processing. In the first case, CUDA technology is employed to accelerate the computation of approximation of motion between two images, known also as optical flow. As for mesh processing, we exploit the massively parallel architecture of CUDA devices to accelerate the face clustering procedure that is employed in many recent mesh segmentation algorithms. In both cases, the results obtained so far are presented and thoroughly discussed, along with the expected future development of the work.
Authors: S. Marras, C. Mura, E. Gobbetti, R. Scateni, R. Scopigno.
Two examples of GPGPU acceleration of memory-intensive algorithm.
EuroGraphics Italian Chapter 2010, 49-56.
Genova, Italia, Novembre 2010.
Abstract: Merging meshes is a recurrent need in geometry modeling and it is a critical step in the 3D acquisition pipeline, where it is used for building a single mesh from several range scans. A pioneering simple and effective solution to merging is represented by the Zippering algorithm (Turk and Levoy, 1994), which consists of simply stitching the meshes together along their borders. In this paper we propose a new extended version of the zippering algorithm that enables the user to control the resulting mesh by introducing quality criteria in the selection of redundant data, and allows to zip together meshes with different granularity by an ad hoc refinement algorithm.