@inproceedings{Mattausch-2003-Str, title = "Strategies for Interactive Exploration of 3D Flow Using Evenly-Spaced Illuminated Streamlines", author = "Oliver Mattausch and Thomas Theu{\ss}l and Helwig Hauser and Eduard Gr\"{o}ller", year = "2003", month = apr, isbn = "158113861x", publisher = "SCCG", editor = "K. Joy", booktitle = "Proceedings of Spring Conference on Computer Graphics", pages = "213 --222", keywords = "flow visualization, streamlines, focus and context", URL = "https://www.cg.tuwien.ac.at/research/publications/2003/Mattausch-2003-Str/", } @techreport{Mattausch-2003-SIE, title = "Strategies for Interactive Exploration of 3D Flow Using Evenly-Spaced Illuminated Streamlines", author = "Oliver Mattausch and Thomas Theu{\ss}l and Helwig Hauser and Eduard Gr\"{o}ller", year = "2003", abstract = "This paper presents several strategies to interactively explore 3D flow. Based on a fast illuminated streamlines algorithm, standard graphics hardware is sufficient to gain interactive rendering rates. Our approach does not require the user to have any prior knowledge of flow features. After the streamlines are computed in a short preprocessing time, the user can interactively change appearance and density of the streamlines to further explore the flow. Most important flow features like velocity or pressure not only can be mapped to all available streamline appearance properties like streamline width, material, opacity, but also to streamline density. To improve spatial perception of the 3D flow we apply techniques based on animation, depth cueing, and halos along a streamline if it is crossed by another streamline in the foreground. Finally, we make intense use of focus+context methods like magic volumes, region of interest driven streamline placing, and spotlights to solve the occlusion problem.", month = apr, number = "TR-186-2-03-04", 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 = "3D flow visualization, illuminated streamlines, interactive exploration, focus+context visualization", URL = "https://www.cg.tuwien.ac.at/research/publications/2003/Mattausch-2003-SIE/", } @incollection{Hauser-2003-Acc, title = "Access to surface properties up to order two for visualization algorithms", author = "Helwig Hauser and Thomas Theu{\ss}l and Eduard Gr\"{o}ller", year = "2003", booktitle = "?", editor = "G. Brunnett, B. Hamann, H. M�ller, L. Linsen", isbn = "16123786", publisher = "Springer", pages = "?", URL = "https://www.cg.tuwien.ac.at/research/publications/2003/Hauser-2003-Acc/", } @inproceedings{Kanitsar-2003-Dem, title = "Demonstration of different segmentation and visualization techniques by means of a complex real world object exemplified by a Christmas tree", author = "Armin Kanitsar and Dominik Fleischmann and Thomas Theu{\ss}l and Lukas Mroz and Milo\v{s} \v{S}r\'{a}mek and Eduard Gr\"{o}ller", year = "2003", publisher = "ECR", booktitle = "European Congress of Radiology", URL = "https://www.cg.tuwien.ac.at/research/publications/2003/Kanitsar-2003-Dem/", } @inproceedings{Theussl-2003-Rec, title = "Reconstruction issues in volume visualization", author = "Thomas Theu{\ss}l and J. M\"{o}ller and Ji\v{r}\'{i} Hlad\r{u}vka and Eduard Gr\"{o}ller", year = "2003", isbn = "1402072597", publisher = "Kluwer Academic Publishers", editor = "F. Post, G. Nielson, G.P. Bonneau", booktitle = "Data Visualization: The state of the art", pages = "109--124", URL = "https://www.cg.tuwien.ac.at/research/publications/2003/Theussl-2003-Rec/", } @inproceedings{Hadwiger-2003-MIP, title = "MIP-Mapping With Procedural and Texture-Based Magnification", author = "Markus Hadwiger and Thomas Theu{\ss}l and Helwig Hauser and Eduard Gr\"{o}ller", year = "2003", publisher = "ACM", booktitle = "Sketches & Applications", URL = "https://www.cg.tuwien.ac.at/research/publications/2003/Hadwiger-2003-MIP/", } @techreport{Theussl-2002-RSH, title = "Reconstruction Schemes for High Quality Raycasting of the Body-Centered Cubic Grid", author = "Thomas Theu{\ss}l and Oliver Mattausch and Torsten M\"{o}ller and Eduard Gr\"{o}ller", year = "2002", abstract = "The body-centered cubic (BCC) grid has received attention in the volume visualization community recently due to its ability to represent the same data with almost 30\% fewer samples as compared to the Cartesian cubic (CC) grid. In this paper we present several resampling strategies for raycasting BCC grids. These strategies range from 2D interpolation in planes to piece-wise linear (barycentric) interpolation in a tetrahedral decomposition of the grid to trilinear and sheared trilinear interpolation. We compare them to raycasting with comparable resampling techniques in the commonly used CC grid in terms of computational complexity and visual quality.", month = dec, number = "TR-186-2-02-11", 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 = "interpolation, body-centered cubic grid, raycasting", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/Theussl-2002-RSH/", } @inproceedings{Hadwiger-2002-Fas, title = "Fast and Flexible High-Quality Texture Filtering With Tiled High-Resolution Filters", author = "Markus Hadwiger and Ivan Viola and Thomas Theu{\ss}l and Helwig Hauser", year = "2002", abstract = "Current graphics hardware offers only very limited support for convolution operations, which is primarily intended for image processing. The input and output sample grids have to coincide, making it impossible to use these features for more general filtering tasks such as image or texture resampling. Furthermore, most hardware employs linear interpolation for texture reconstruction purposes, incurring noticeable artifacts. Higher-order interpolation via general convolution is able to remove most of these artifacts. Real-time applications currently do not consider higher-order filtering due to lack of hardware support. We present algorithms for extremely fast convolution on graphics hardware. This framework can be used for general convolution tasks, but is especially suited to substituting the native bilinear or tri-linear interpolation currently used for texture magnification, while still achieving frame rates of up to 100 frames per second for full screen filtering with bi-cubic interpolation.", month = nov, publisher = "Akademische Verlagsgesellschaft Aka GmbH, Berlin", booktitle = "Vision, Modeling and Visualization 2002", pages = "155--162", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/Hadwiger-2002-Fas/", } @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/", } @techreport{Hauser-2002-SSI, title = "Smart surface interrogation for advanced visualization techniques", author = "Helwig Hauser and Thomas Theu{\ss}l and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "2002", abstract = "Highly elaborated visualization techniques that are based on surfaces often are independent from the origin of the surface data. Nevertheless, most of the recently presented advanced visualization methods were developed for a specific type of surface although principally applicable to generic surfaces. In this paper we discuss a unified surface interrogation model which provides generic access to surface properties up to degree two, i.e., surface point locations, normals, and curvature properties, (almost) regardless of the origin of the surface. Surface types and interrogation algorithms are compared and summarized. At the end of this paper we present an object-oriented implementation of this model, called SMURF.", month = jan, number = "TR-186-2-02-01", 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 = "surface properties, surfaces, visualization", URL = "https://www.cg.tuwien.ac.at/research/publications/2002/Hauser-2002-SSI/", } @techreport{Theussl-2001-RIV, title = "Reconstruction Issues in Volume Visualization", author = "Thomas Theu{\ss}l and Torsten M\"{o}ller and Ji\v{r}\'{i} Hlad\r{u}vka and Eduard Gr\"{o}ller", year = "2001", abstract = "Although volume visualization has already grown out of its infancy, the most commonly used reconstruction techniques are still trilinear interpolation for function reconstruction and central differences (most often in conjunction with trilinear interpolation) for gradient reconstruction. Nevertheless, quite some research in the last few years was devoted to improve this situation. This paper surveys the more important methods, emphasizing selected work in function and gradient reconstruction, and gives an overview over the rather new development of exploiting curvature properties for volume visualization purposes.", month = jun, number = "TR-186-2-01-14", 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 = "Taylor series expansion, frequency response, windowing, ideal reconstruction", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/Theussl-2001-RIV/", } @techreport{Theussl-2001-ORS, title = "Optimal Regular Volume Sampling", author = "Thomas Theu{\ss}l and Torsten M\"{o}ller and Eduard Gr\"{o}ller", year = "2001", abstract = "The classification of volumetric data sets as well as their rendering algorithms are typically based on the representation of the underlying grid. Grid structures based on a Cartesian lattice are the de-facto standard for regular representations of volumetric data. In this paper we introduce a more general concept of regular grids for the representation of volumetric data. We demonstrate that a specific type of regular lattice - the so-called body-centered cubic - is able to represent the same data set as a Cartesian grid to the same accuracy but with 29.3% less samples. This speeds up traditional volume rendering algorithms by the same ratio, which we demonstrate by adopting a splatting implementation for these new lattices. We investigate different filtering methods required for computing the normals on this lattice. The lattice representation results also in lossless compression ratios that are better than previously reported. Although other regular grid structures achieve the same sample efficiency, the body-centered cubic is particularly easy to use. The only assumption necessary is that the underlying volume is isotropic and band-limited - an assumption that is valid for most practical data sets.", month = apr, number = "TR-186-2-01-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 = "body centered cubic, hexagonal sampling, close packing, Cartesian grid, volume data", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/Theussl-2001-ORS/", } @misc{a-2001-ahr, title = "Optimal Regular Volume Sampling", author = "Eduard Gr\"{o}ller and Thomas Theu{\ss}l and Torsten M\"{o}ller", year = "2001", note = "Proceedings of IEEE Visualization 2001, October 2001, San Diego, USA, pp. 91-98", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/a-2001-ahr/", } @misc{a-2001-Rec, title = "Reconstruction Issues in Volume Visualization", author = "Eduard Gr\"{o}ller and Thomas Theu{\ss}l and Ji\v{r}\'{i} Hlad\r{u}vka and Torsten M\"{o}ller", year = "2001", note = "Proceedings of Dagstuhl Seminar on Scientific Visualization, 2000", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/a-2001-Rec/", } @misc{a-2001-ah, title = "Hardware Accelerated High-Quality Reconstruction of Volumetric Data on PC Consumer Hardware", author = "Eduard Gr\"{o}ller and Thomas Theu{\ss}l and Helwig Hauser and Markus Hadwiger", year = "2001", note = "Proceedings of Vision, Modeling, and Visualization 2001, November 2001, Stuttgart, Germany, pp. 105-112", URL = "https://www.cg.tuwien.ac.at/research/publications/2001/a-2001-ah/", } @techreport{Theussl-2000-MWI, title = "Mastering Windows: Improving Reconstruction", author = "Thomas Theu{\ss}l and Helwig Hauser and Eduard Gr\"{o}ller", year = "2000", abstract = "Ideal reconstruction filters, for function or arbitrary derivative reconstruction, have to be bounded in order to be practicable since they are infinite in their spatial extent. This can be accomplished by multiplying them with windowing functions. In this paper we discuss and assess the quality of commonly used windows and show that most of them are unsatisfactory in terms of numerical accuracy. The best performing windows are Blackman, Kaiser and Gaussian windows. The latter two are particularly useful since both have a parameter to control their shape, which, on the other hand, requires to find appropriate values for these parameters. We show how to derive optimal parameter values for Kaiser and Gaussian windows using a Taylor series expansion of the convolution sum. Optimal values for function and first derivative reconstruction for window widths of two, three, four and five are presented explicitly.", month = apr, number = "TR-186-2-00-08", 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 = "Taylor series expansion, frequency response, windowing, ideal reconstruction", URL = "https://www.cg.tuwien.ac.at/research/publications/2000/Theussl-2000-MWI/", } @techreport{Hauser-1999-SSI, title = "Smart surface interrogation for advanced visualization techniques", author = "Helwig Hauser and Thomas Theu{\ss}l and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "1999", abstract = "Highly elaborated visualization techniques that are based on surfaces often are independent from the origin of the surface data. Nevertheless, most of the recently presented advanced visualizatio methods were developed for a specific type of surface although principally applicable to generic surfaces. In this paper we discuss a unified surface interrogation model which provides generic access to surface properties up to degree two, i.e., surface-point locations, normals, and curvature properties, regardless of the origin of the surface. Surface types and interrogation algorithms are compared and summarized. At the end of this paper we present an object-oriented implementation of this model, called {\sc{}Smurf", month = nov, number = "TR-186-2-99-19", 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 = "surface properties, surfaces, visualization", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Hauser-1999-SSI/", } @techreport{Theussl-1999-MDH, title = "The Multi-Dimensional Hartley Transform as a Basis for Volume Rendering", author = "Thomas Theu{\ss}l and Robert F. Tobler and Eduard Gr\"{o}ller", year = "1999", abstract = "The Fast Hartley Transform (FHT), a discrete version of the Hartley Transform (HT), has been studied in various papers and shown to be faster and more convenient to implement and handle than the corresponding Fast Fourier Transform (FFT). As the HT is not as nicely separable as the FT, a multidimensional version of the HT needs to perform a final correction step to convert the result of separate HTs for each dimension into the final multi-dimensional transform. Although there exist algorithms for two and three dimensions, no generalization to arbitrary dimensions can be found in the literature. We demonstrate an easily comprehensible and efficient implementation of the fast HT and its multi-dimensional extension. By adapting this algorithm to volume rendering by the projection-slice theorem and by the use for filter analysis in frequency domain we further demonstrate the importance of the HT in this application area.", month = oct, number = "TR-186-2-99-21", 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 rendering, Fourier transform, Hartley transform", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Theussl-1999-MDH/", } @misc{Loeffelmann-1999-SMU, title = "SMURF a Smart Surface model for advanced visualization techniques", author = "Eduard Gr\"{o}ller and Thomas Theu{\ss}l and Andreas K\"{o}nig and Helwig L\"{o}ffelmann", 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. 156-164.", URL = "https://www.cg.tuwien.ac.at/research/publications/1999/Loeffelmann-1999-SMU/", } @techreport{Loeffelmann-1998-SMURF, title = "Smurf -- a Smart surface model for advanced visualization techniques", author = "Helwig L\"{o}ffelmann and Thomas Theu{\ss}l and Andreas K\"{o}nig and Eduard Gr\"{o}ller", year = "1998", abstract = "Highly elaborated visualization techniques that are based on surfaces often are independent from the origin of the surface data. For re-using advanced visualization methods for surfaces of various kind, we developed an abstract surface interrogation layer called Smurf. In this paper we discuss the steps necessary to unify multiple types of surfaces under a shared general purpose interface.", month = oct, number = "TR-186-2-98-26", 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 = "surfaces, visualization", URL = "https://www.cg.tuwien.ac.at/research/publications/1998/Loeffelmann-1998-SMURF/", }