|Title:||A fast method fo applying rigid transformations to volume data|
del Río, A.
|Citation:||WSCG '2004: Short Communications: the 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2004, 2.-6. February 2004 Plzeň, p. 55-62.|
|Publisher:||Václav Skala - UNION Agency|
|Document type:||konferenční příspěvek|
|Keywords:||objemová data;rigidní transformace;interpolace;Bresenhamův algoritmus|
|Keywords in different language:||volume data;rigid transformations;interpolation;Bresenham algorithm|
|Abstract:||Volume rendering is a widespread method for displaying graphical models in fields such as medical visualization or engineering. The required image information is stored in a volume dataset, which is a threedimensional array of voxel intensities. Sometimes it is necessary to transform a given volume dataset by geometric transformations like rotation, scaling or translation. In this process, a new volume dataset containing the transformed volume is generated. Straightforward algorithms with an emphasis on minimizing the resampling error are the standard approach to computing such transformations. In this paper we present a new algorithm, which is significantly faster than these. Since it is based on a simple interpolation scheme, it is useful for generating fast previews. Depending on their size and voxel bit depth, it can even provide realtime transformation of volumes.|
|Rights:||© Václav Skala - UNION Agency|
|Appears in Collections:||WSCG '2004: Short Communications|
Please use this identifier to cite or link to this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.