@WorkshopTalk{Vad_Viktor_2015_RVV, title = "Reproducibility, Verification, and Validation of Experiments on the Marschner-Lobb Test Signal", author = "Viktor Vad and Bal\'{a}zs Cs\'{e}bfalvi and Peter Rautek and Eduard Gr\"{o}ller", year = "2015", abstract = "The Marschner-Lobb (ML) test signal has been used for two decades to evaluate the visual quality of different volumetric reconstruction schemes. Previously, the reproduction of these experiments was very simple, as the ML signal was used to evaluate only compact filters applied on the traditional Cartesian lattice. As the Cartesian lattice is separable, it is easy to implement these filters as separable tensor-product extensions of well-known 1D filter kernels. Recently, however, non-separable reconstruction filters have received increased attention that are much more difficult to implement than the traditional tensor-product filters. Even if these are piecewise polynomial filters, the space partitions of the polynomial pieces are geometrically rather complicated. Therefore, the reproduction of the ML experiments is getting more and more difficult. Recently, we reproduced a previously published ML experiment for comparing Cartesian Cubic (CC), Body-Centered Cubic (BCC), and Face-Centered Cubic (FCC) lattices in terms of prealiasing. We recognized that the previously applied settings were biased and gave an undue advantage to the FCC-sampled ML representation. This result clearly shows that reproducibility, verification, and validation of the ML experiments is of crucial importance as the ML signal is the most frequently used benchmark for demonstrating the superiority of a reconstruction scheme or volume representations on non-Cartesian lattices.", month = may, event = "EuroVis Workshop on Reproducibility, Verification, and Validation in Visualization (EuroRV3)", location = "Cagliari, Sardinia, Italy", journal = "@inproceedings {eurorv3.20151140", URL = "https://www.cg.tuwien.ac.at/research/publications/2015/Vad_Viktor_2015_RVV/", } @article{Rautek_Peter_2014_TUC, title = "Towards an Unbiased Comparison of CC, BCC, and FCC Lattices in Terms of Prealiasing", author = "Viktor Vad and Bal\'{a}zs Cs\'{e}bfalvi and Peter Rautek and Eduard Gr\"{o}ller", year = "2014", abstract = "In the literature on optimal regular volume sampling, the Body-Centered Cubic (BCC) lattice has been proven to be optimal for sampling spherically band-limited signals above the Nyquist limit. On the other hand, if the sampling frequency is below the Nyquist limit, the Face-Centered Cubic (FCC) lattice was demonstrated to be optimal in reducing the prealiasing effect. In this paper, we confirm that the FCC lattice is indeed optimal in this sense in a certain interval of the sampling frequency. By theoretically estimating the prealiasing error in a realistic range of the sampling frequency, we show that in other frequency intervals, the BCC lattice and even the traditional Cartesian Cubic (CC) lattice are expected to minimize the prealiasing. The BCC lattice is superior over the FCC lattice if the sampling frequency is not significantly below the Nyquist limit. Interestingly, if the original signal is drastically undersampled, the CC lattice is expected to provide the lowest prealiasing error. Additionally, we give a comprehensible clarification that the sampling efficiency of the FCC lattice is lower than that of the BCC lattice. Although this is a well-known fact, the exact percentage has been erroneously reported in the literature. Furthermore, for the sake of an unbiased comparison, we propose to rotate the Marschner-Lobb test signal such that an undue advantage is not given to either lattice.", month = jun, journal = "Computer Graphics Forum", volume = "33", number = "3", pages = "81--90", keywords = " Image representation—Volumetric, Picture/Image Generation—Display algorit, Categories and Subject Descriptors", URL = "https://www.cg.tuwien.ac.at/research/publications/2014/Rautek_Peter_2014_TUC/", } @inproceedings{Csebfalvi-2012-IOM, title = "Illumination-Driven Opacity Modulation for Expressive Volume Rendering", author = "Bal\'{a}zs Cs\'{e}bfalvi and Bal\'{a}zs T\'{o}th and Stefan Bruckner and Eduard Gr\"{o}ller", year = "2012", abstract = "Using classical volume visualization, typically a couple of isosurface layers are rendered semi-transparently to show the internal structures contained in the data. However, the opacity transfer function is often difficult to specify such that all the isosurfaces are of high contrast and sufficiently perceivable. In this paper, we propose a volumerendering technique which ensures that the different layers contribute to fairly different regions of the image space. Since the overlapping between the effected regions is reduced, an outer translucent isosurface does not decrease significantly the contrast of a partially hidden inner isosurface. Therefore, the layers of the data become visually well separated. Traditional transfer functions assign color and opacity values to the voxels depending on the density and the gradient. In contrast, we assign also different illumination directions to different materials, and modulate the opacities view-dependently based on the surface normals and the directions of the light sources, which are fixed to the viewing angle. We will demonstrate that this model allows an expressive visualization of volumetric data.", month = nov, location = "Magdeburg, Germany", booktitle = "Proceedings of Vision, Modeling & Visualization 2012", pages = "103--109", keywords = "illustrative visualization, illumination, volume rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2012/Csebfalvi-2012-IOM/", } @inproceedings{RAUTEK06, title = "D²VR: High Quality Volume Rendering of Projection-based Volumetric Data", author = "Peter Rautek and Bal\'{a}zs Cs\'{e}bfalvi and S\"{o}ren Grimm and Stefan Bruckner and Eduard Gr\"{o}ller", year = "2006", abstract = "Volume rendering techniques are conventionally classified as either direct or indirect methods. Indirect methods require to transform the initial volumetric model into an intermediate geometrical model in order to efficiently visualize it. In contrast, direct volume rendering (DVR) methods can directly process the volumetric data. Modern CT scanners usually provide data as a set of samples on a rectilinear grid, which is computed from the measured projections by discrete tomographic reconstruction. Therefore the rectilinear grid can already be considered as an intermediate volume representation. In this paper we introduce direct direct volume rendering (D²VR). D²VR does not require a rectilinear grid, since it is based on an immediate processing of the measured projections. Arbitrary samples for ray casting are reconstructed from the projections by using the Filtered Back-Projection algorithm. Our method removes a lossy resampling step from the classical volume rendering pipeline. It provides much higher accuracy than traditional grid-based resampling techniques do. Furthermore we also present a novel high-quality gradient estimation scheme, which is also based on the Filtered Back-Projection algorithm.", month = may, publisher = "IEEE CS", booktitle = "Proceedings of Eurographics / IEEE VGTC Symposium on Visualization", number = "In Proceedings of EuroVis", pages = "211--218", keywords = "Volume Rendering, Filtered Back-Projection, Reconstruction", URL = "https://www.cg.tuwien.ac.at/research/publications/2006/RAUTEK06/", } @techreport{Csebfalvi-2002-SBICG, title = "Smooth Shape-Based Interpolation using the Conjugate Gradient Method", author = "Bal\'{a}zs Cs\'{e}bfalvi and L\'{a}szl\'{o} Neumann and Armin Kanitsar and Eduard Gr\"{o}ller", year = "2002", abstract = "In this paper a novel technique for smooth shape-based interpolation of volume data is introduced. Previously simple linear interpolation of signed distance maps has been used in practice. As it will be shown, this approach results in artifacts, since sharp edges appear along the original slices. In order to obtain a smooth 3D implicit function generated by interpolating 2D distance maps, we use a global interpolation method instead of a higher order local technique. The global curvature of the implicit function representing an isosurface is minimized using an iterative conjugate gradient method. Because of the iterative approach the user can easily control the trade-off between the smoothness of the isosurface and the computational cost of the refinement. As opposed to previous techniques, like variational interpolation, our method can generate a reasonably good approximation of the ideal solution in a significantly shorter time.", month = aug, number = "TR-186-2-02-10", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "shape-based interpolation, conjugate gradient method, volume rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/Csebfalvi-2002-SBICG/", } @inproceedings{Neumann-2002-Fea, title = "Feature-Preserving Volume Filtering", author = "L\'{a}szl\'{o} Neumann and Bal\'{a}zs Cs\'{e}bfalvi and Ivan Viola and Matej Mlejnek and Eduard Gr\"{o}ller", year = "2002", abstract = "In this paper a feature-preserving volume filtering method is presented. The basic idea is to minimize a three-component global error function penalizing the density and gradient errors and the curvature of the unknown filtered function. The optimization problem leads to a large linear equation system defined by a sparse coefficient matrix. We will show that such an equation system can be efficiently solved in frequency domain using fast Fourier transformation (FFT). For the sake of clarity, first we illustrate our method on a 2D example which is a dedithering problem. Afterwards the 3D extension is discussed in detail since we propose our method mainly for volume filtering. We will show that the 3D version can be efficiently used for elimination of the typical staircase artifacts of direct volume rendering without losing fine details. Unlike local filtering techniques, our novel approach ensures a global smoothing effect. Previous global 3D methods are restricted to binary volumes or segmented iso-surfaces and they are based on area minimization of one single reconstructed surface. In contrast, our method is a general volume-filtering technique, implicitly smoothing all the iso-surfaces at the same time. Although the strength of the presented algorithm is demonstrated on a specific 2D and a specific 3D application, it is considered as a general mathematical tool for processing images and volumes.", month = may, publisher = "ACM", booktitle = "Data Visualization 2002", pages = "105--114", keywords = "antialiasing, noise filtering, derivative and gradient estimation, feature-preserving smoothing, direct volume rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/Neumann-2002-Fea/", } @techreport{kanitsar-2002-Chr, title = "Christmas Tree Case Study: Computed Tomography as a Tool for Mastering Complex Real World Objects with Applications in Computer Graphics", author = "Armin Kanitsar and Thomas Theu{\ss}l and Lukas Mroz and Milo\v{s} \v{S}r\'{a}mek and Anna Vilanova i Bartroli and Bal\'{a}zs Cs\'{e}bfalvi and Ji\v{r}\'{i} Hlad\r{u}vka and Stefan Guthe and Michael Knapp and Rainer Wegenkittl and Petr Felkel and Dominik Fleischmann and Werner Purgathofer and Eduard Gr\"{o}ller", year = "2002", abstract = "We report on using computed tomography (CT) as a model acquisition tool for complex objects in computer graphics. Unlike other modeling and scanning techniques the complexity of the object is irrelevant in CT, which naturally enables to model objects with, for example, concavities, holes, twists or fine surface details. Once the data is scanned, one can apply post-processing techniques aimed at its further enhancement, modification or presentation. For demonstration purposes we chose to scan a Christmas tree which exhibits high complexity which is difficult or even impossible to handle with other techniques. However, care has to be taken to achieve good scanning results with CT. Further, we illustrate the post-processing by means of data segmentation and photorealistic as well as non-photorealistic surface and volume rendering techniques.", month = mar, number = "TR-186-2-02-07", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "volume visualization, computed tomography, modeling", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/kanitsar-2002-Chr/", } @inproceedings{Csebfalvi-2002-Smo, title = "Smooth Shape-Based Interpolation using the Conjugate Gradient Method", author = "Bal\'{a}zs Cs\'{e}bfalvi and L\'{a}szl\'{o} Neumann and Armin Kanitsar and Eduard Gr\"{o}ller", year = "2002", publisher = "Akademische Verlagsgesellschaft Aka GmbH, Berlin", booktitle = "Vision, Modeling, and Visualization 2002", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/Csebfalvi-2002-Smo/", } @techreport{Csebfalvi-2001-NPVR, title = "Fast Visualization of Object Contours by Non-Photorealistic Volume Rendering", author = "Bal\'{a}zs Cs\'{e}bfalvi and Lukas Mroz and Helwig Hauser and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "2001", abstract = "In this paper we present a fast visualization technique for volumetric data, which is based on a recent non-photorealistic rendering technique. Our new approach enables alternative insights into 3D data sets (compared to traditional approaches such as direct volume rendering or iso-surface rendering). Object contours, which usually are characterized by locally high gradient values, are visualized regardless of their density values. Cumbersome tuning of transfer functions, as usually needed for setting up DVR views is avoided. Instead, a small number of parameters is available to adjust the non-photorealistic display. Based on the magnitude of local gradient information as well as on the angle between viewing direction and gradient vector, data values are mapped to visual properties (color, opacity), which then are combined to form the rendered image (MIP is proposed as the default compositing stragtegy here). Due to the fast implementation of this alternative rendering approach, it is possible to interactively investigate the 3D data, and quickly learn about internal structures. Several further extensions of our new approach, such as level lines are also presented in this paper.", month = apr, number = "TR-186-2-01-09", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "shear-warp projection, non-photorealistic rendering, interactive volume rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/Csebfalvi-2001-NPVR/", } @misc{Csebfalvi-2001-Fas, title = "Fast Visualization of Object Contours by Non-Photorealistic Volume Rendering", author = "Eduard Gr\"{o}ller and Helwig Hauser and Lukas Mroz and Andreas K\"{o}nig and Bal\'{a}zs Cs\'{e}bfalvi", year = "2001", note = "Proceedings of Eurographics 2001, 4-7 September 2001, Manchester, United Kingdom", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/Csebfalvi-2001-Fas/", } @phdthesis{Csebfalvi-thesis, title = "Interactive Volume-Rendering Techniques for Medical Data Visualization", author = "Bal\'{a}zs Cs\'{e}bfalvi", year = "2001", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", school = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/Csebfalvi-thesis/", } @misc{Csebfalvi-2001-Int, title = "Interactive Volume Rendering based on a "Bubble Model"", author = "Eduard Gr\"{o}ller and Bal\'{a}zs Cs\'{e}bfalvi", year = "2001", note = "Proceedings of Graphics Interface 2001, June 7th-9th, 2001, Ottawa, Ontario, Canada", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/Csebfalvi-2001-Int/", } @techreport{Csebfalvi-2000-IVRBM, title = "Interactive Volume Rendering based on a ''Bubble Model''", author = "Bal\'{a}zs Cs\'{e}bfalvi and Eduard Gr\"{o}ller", year = "2000", abstract = "In this paper an interactive volume rendering technique is presented which is based on a novel visualization model. We call the basic method ``bubble model'' since iso-surfaces are rendered as thin semi-transparent membranes similarly to blown soap bubbles. The primary goal is to develop a fast previewing technique for volumetric data which does not require a time consuming transfer function specification to visualize internal structures. Our approach uses a very simple rendering model controlled by only two parameters. We also present an interactive rotation technique which does not rely on any specialized hardware, therefore it can be widely used even on low-end machines. Due to the interactive display, fine tuning is also supported since the modification of the rendering parameters has an immediate visual feedback.", month = dec, number = "TR-186-2-00-23", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "Shear-Warp Factorization., Previewing, Direct Volume Rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2000/Csebfalvi-2000-IVRBM/", } @techreport{Csebfalvi-2000-GELR, title = "Gradient Estimation in Volume Data using 4D Linear Regression", author = "L\'{a}szl\'{o} Neumann and Bal\'{a}zs Cs\'{e}bfalvi and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "2000", abstract = "In this paper a new gradient estimation method is presented which is based on linear regression. Previous contextual shading techniques try to fit an approximate function to a set of surface points in the neighborhood of a given voxel. Therefore, a system of linear equations has to be solved using the computationally expensive Gaussian elimination. In contrast, our method approximates the density function itself in a local neighborhood with a 3D regression hyperplane. This approach also leads to a system of linear equations but we will show that it can be solved with an efficient convolution. Our method provides at each voxel location the normal vector and the translation of the regression hyperplane which are considered as a gradient and a filtered density value respectively. Therefore, this technique can be used for surface smoothing and gradient estimation at the same time. ", month = feb, number = "TR-186-2-00-03", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "Linear Regression., Gradient Estimation, Volume Rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/2000/Csebfalvi-2000-GELR/", } @misc{Csebfalvi-2000-Fas, title = "Fast Surface Rendering of Volumetric Data", author = "Eduard Gr\"{o}ller and Andreas K\"{o}nig and Bal\'{a}zs Cs\'{e}bfalvi", year = "2000", note = "N.M.Thalmann, V. Skala (eds.), Proceedings of WSCG'2000, the 8-th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media'2000, February 7-11, 2000, Plzen, Czech Republic, Short communication papers, pp. 9-16", URL = "https://www.cg.tuwien.ac.at/research/publications/2000/Csebfalvi-2000-Fas/", } @misc{Csebfalvi-2000-Gra, title = "Gradient Estimation in Volume Data using 4D Linear Regression", author = "Eduard Gr\"{o}ller and L\'{a}szl\'{o} Neumann and Andreas K\"{o}nig and Bal\'{a}zs Cs\'{e}bfalvi", year = "2000", note = "Eurographics 2000, Interlaken, Switzerland", URL = "https://www.cg.tuwien.ac.at/research/publications/2000/Csebfalvi-2000-Gra/", } @misc{Neumann-2000-Gra, title = "Gradient Estimation in Volume Data using 4D Linear Regression", author = "Eduard Gr\"{o}ller and L\'{a}szl\'{o} Neumann and Andreas K\"{o}nig and Bal\'{a}zs Cs\'{e}bfalvi", year = "2000", note = "Computer Graphics Forum 19(3), 2000, pp. C-351 - C-357", URL = "https://www.cg.tuwien.ac.at/research/publications/2000/Neumann-2000-Gra/", } @techreport{Fuhr-1999-Multi, title = "Fast Surface Rendering of Volumetric Data", author = "Bal\'{a}zs Cs\'{e}bfalvi and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "1999", abstract = "In this paper a new direct volume-rendering method is presented for fast display of iso-surfaces. In order to reduce the data to be processed, the algorithm eliminates those voxels which are invisible from a specific domain of viewing directions. The remaining surface points are stored in an appropriate data structure optimized for fast shear-warp projection. The proposed data structure also supports the application of cutting planes in order to visualize the internal part of the volume as well. Unlike many other surface-oriented techniques, the presented method does not trade image quality for speed. It does not require any specialized hardware either to achieve interactive frame rates, thus it can be widely used in medical imaging applications even on low end hardware.", month = may, number = "TR-186-2-99-13", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "Medical Imaging., Volume Rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Fuhr-1999-Multi/", } @techreport{Csebfalvi-1999-BSW, title = "Fast Volume Rotation using Binary Shear-Warp Factorization", author = "Bal\'{a}zs Cs\'{e}bfalvi", year = "1999", abstract = "This paper presents a fast volume rotation technique based on binary shear-warp factorization. Unlike many acceleration algorithms this method does not trade image quality for speed and does not require any specialized hardware either. In order to skip precisely the empty regions along the rays to be evaluated a binary volume is generated indicating the locations of the transparent cells. This mask is rotated by an incremental binary shear transformation, executing bitwise boolean operations on integers storing the bits of the binary volume. The ray casting is accelerated using the transformed mask and an appropriate lookup-table technique for finding the first non-transparent cell along each ray.", month = mar, number = "TR-186-2-99-07", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "Shear-Warp Factorization., Volume Rendering", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Csebfalvi-1999-BSW/", } @techreport{Csebfalvi-1999-MIP, title = "Fast Maximum Intensity Projection using Binary Shear-Warp Factorization", author = "Bal\'{a}zs Cs\'{e}bfalvi and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "1999", abstract = "This paper presents a fast maximum intensity projection technique based on binary shear-warp factorization. The proposed method divides the density domain into a small number of intervals, and to each interval a binary code representation is assigned. In a preprocessing step, an additional volume is created which contains for each voxel the code of the interval enclosing the given voxel density. We present an appropriate data structure for storing this volume and an efficient lookup table technique which can be used to rapidly access a voxel of a certain density code. The volume is efficiently resampled along viewing rays only in voxels where the densities reside in the interval which contains the appropriate maximum value.", month = jan, number = "TR-186-2-99-02", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", keywords = "Shear-Warp Factorization., Volume Rendering, Maximum Intensity Projection", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Csebfalvi-1999-MIP/", } @misc{Csebfalvi-1999-Fas, title = "Fast Volume Rotation using Binary Shear-Warp Factorization.", author = "Bal\'{a}zs Cs\'{e}bfalvi", year = "1999", note = "Joint EUROGRAPHICS-IEEE TCCG Symposium on Visualization, Vienna, 1999.", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Csebfalvi-1999-Fas/", } @misc{Csebfalvi-1999-Int, title = "Interactive Volume Rotation. ", author = "L\'{a}szl\'{o} Szirmay-Kalos and Bal\'{a}zs Cs\'{e}bfalvi", year = "1999", note = "Journal Machine Graphics & Vision, 1999.", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Csebfalvi-1999-Int/", } @misc{Szirmay-1999-Imp, title = "Importance Driven Quasi-Random Walk Solution of the Rendering Equation.", author = "Werner Purgathofer and L\'{a}szl\'{o} Szirmay-Kalos and Bal\'{a}zs Cs\'{e}bfalvi", year = "1999", note = "Computers&Graphics, No.23(2), 
Pergamon Press, New York, 1999.", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Szirmay-1999-Imp/", } @misc{Csebfalvi-1999-Fast, title = "Fast Maximum Intensity Projection using Binary Shear-Warp Factorization.", author = "Eduard Gr\"{o}ller and Andreas K\"{o}nig and Bal\'{a}zs Cs\'{e}bfalvi", year = "1999", note = "N.M. Thalmann, V. Skala (eds.),
Proceedings of WSCG'99, The 7-th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media'99, February 8 - 12, 1999, Plzen, Czech Republic, Vol. I, pp. 47-54.", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Csebfalvi-1999-Fast/", } @misc{Csebfalvi-1998-AnI, title = "An Incremental Algorithm for Fast Rotation of Volumetric Data", author = "Bal\'{a}zs Cs\'{e}bfalvi", year = "1998", note = "Spring Conference on Computer Graphics, Budmerice, 1998.", URL = "https://www.cg.tuwien.ac.at/research/publications/1998/Csebfalvi-1998-AnI/", } @misc{Szirmay-1998-Imp, title = "Importance Driven Quasi-Random Walk Solution of the Rendering Equation", author = "Werner Purgathofer and L\'{a}szl\'{o} Szirmay-Kalos and Bal\'{a}zs Cs\'{e}bfalvi", year = "1998", note = "In proceedings of WSCG98, Plzen, 1998.", URL = "https://www.cg.tuwien.ac.at/research/publications/1998/Szirmay-1998-Imp/", }