{"title":"Visualizing vector fields using line integral convolution and dye advection","authors":"Han-Wei Shen, Christopher R. Johnson, K. Ma","doi":"10.1109/SVV.1996.558044","DOIUrl":"https://doi.org/10.1109/SVV.1996.558044","url":null,"abstract":"We present local and global techniques to visualize three-dimensional vector field data. Using the Line Integral Convolution (LIC) method to image the global vector field, our new algorithm allows the user to introduce colored \"dye\" into the vector field to highlight local flow features. A fast algorithm is proposed that quickly recomputes the dyed LIC images. In addition, we introduce volume rendering methods that can map the LIC texture on any contour surface and/or translucent region defined by additional scalar quantities, and can follow the advection of colored dye throughout the volume.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122692993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David M. Reed, R. Yagel, A. Law, Po-Wen Shin, N. Shareef
{"title":"Hardware assisted volume rendering of unstructured grids by incremental slicing","authors":"David M. Reed, R. Yagel, A. Law, Po-Wen Shin, N. Shareef","doi":"10.1109/SVV.1996.558043","DOIUrl":"https://doi.org/10.1109/SVV.1996.558043","url":null,"abstract":"Some of the more important research results in computational science rely on the use of simulation methods that operate on unstructured grids. However, these grids, composed of a set of polyhedra, introduce exceptional problems with respect to data visualization. Volume rendering techniques, originally developed to handle rectangular grids, show significant promise for general use with unstructured grids as well. The main disadvantage of this approach, compared to isosurfaces, particles or other visualization tools is its non-interactive performance. We describe an efficient method for rendering unstructured grids that is based on incremental slicing and hardware polygon rendering. For a given view direction, the grid vertices are transformed to image space using available graphics hardware. We then incrementally compute the 2D polygon-meshes that result from letting a set of planes, parallel to the screen plane, intersect (slice) the transformed grid. Finally, we use the graphics hardware to render (interpolate-fill) the polygon-meshes and composite them in visibility order. We show that, in addition to being faster than existing methods, our approach also provides adaptive control and progressive image generation. The adaptive method provides user control to ensure that the contribution of every cell is included in the final image or to limit the number of cells that are missed.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"43 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124471787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Paolo Cignoni, C. Montani, E. Puppo, Roberto Scopigno
{"title":"Optimal isosurface extraction from irregular volume data","authors":"Paolo Cignoni, C. Montani, E. Puppo, Roberto Scopigno","doi":"10.1109/SVV.1996.558040","DOIUrl":"https://doi.org/10.1109/SVV.1996.558040","url":null,"abstract":"A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a data structure called interval tree, which encodes a set of intervals on the real line, and supports efficient retrieval of all intervals containing a given value. Each cell in the volume data is associated with an interval bounded by the extreme values of the field in the cell. All cells intersected by a given isosurface are extracted in O(m+log h) time, with m the output size and h the number of different extreme values (min or max). The implementation of the method is simple. Tests have shown that its practical performance reflects the theoretical optimality.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134645026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cube-4-a scalable architecture for real-time volume rendering","authors":"H. Pfister, A. Kaufman","doi":"10.1109/SVV.1996.558042","DOIUrl":"https://doi.org/10.1109/SVV.1996.558042","url":null,"abstract":"We present Cube-4, a special-purpose volume rendering architecture that is capable of rendering high-resolution (e.g., 1024/sup 3/) datasets at 30 frames per second. The underlying algorithm, called slice-parallel ray-casting, uses tri-linear interpolation of samples between data slices for parallel and perspective projections. The architecture uses a distributed interleaved memory, several parallel processing pipelines, and an innovative parallel data flow scheme that requires no global communication, except at the pixel level. This leads to local, fixed bandwidth interconnections and has the benefits of high memory bandwidth, real-time data input, modularity, and scalability. We have simulated the architecture and have implemented a working prototype of the complete hardware on a configurable custom hardware machine. Our results indicate true real-time performance for high-resolution datasets and linear scalability of performance with the number of processing pipelines.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"3D shock wave visualization on unstructured grids","authors":"K. Ma, J. Rosendale, Willem Vermeer","doi":"10.1109/SVV.1996.558049","DOIUrl":"https://doi.org/10.1109/SVV.1996.558049","url":null,"abstract":"A critical issue in understanding high speed flows is the study of shock waves. The paper summarizes our research on techniques for the detection and visualization of shock waves occuring in simulations of three dimensional flows on unstructured grids. Detection algorithms based on Mach number, density gradient and directional derivatives are compared using a data set from calculations of a transonic flow with a weak double shock around an airfoil. Both surface and volume rendering techniques are used to display the shocks. The issues in this research area are very much like those occurring in medical imaging. Since the data themselves (in this case the results of the fluid dynamics simulation) are intrinsically low resolution and noisy, properly extracting and visualizing the shock is very difficult. In this environment, blurry, low resolution techniques, like the splatting volume rendering, seem to do rather well. More complex schemes, using sophisticated numerical shock detectors coupled with polygon rendering, produce visually sharper shocks, but also introduce \"graphics artifacts,\" which complicate understanding of the flow physics. On the other hand, visualization results produced with techniques like splatting are, in effect, relying more on the human visual system to compensate for limited resolution in the simulation.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128025634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast sliding thin slab volume visualization","authors":"S. Y. Yen, S. Napel, G. Rubin","doi":"10.1109/SVV.1996.558048","DOIUrl":"https://doi.org/10.1109/SVV.1996.558048","url":null,"abstract":"We present a method for fast rendering of a thin slab bounded by a set of clipping planes oriented perpendicular to the viewing direction. Our implementation allows the user to specify the view direction, slab thickness and slab position within the volume and performs either classical volume rendering or maximum intensity projection. The system can either render single slabs or a sequence of slabs that overlap and traverse the volume perpendicular to the viewing direction. This rapid rendering of geometrically segmented portions of the volume allows the user to explore the volume data or focus on a region or subvolume of interest. The rendering time for a thin slab with a thickness of approximately 4-5 times that of acquired sections, within a 256/sup 2//spl times/167 data set, is 0.6 seconds when averaged over a range of viewing angles. The renderings are performed on an SGI Indigo 2 workstation without graphics accelerators.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127632650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast volume rendering with adjustable color maps","authors":"K. Kaneda, Y. Dobashi, K. Yamamoto, H. Yamashita","doi":"10.1109/SVV.1996.558037","DOIUrl":"https://doi.org/10.1109/SVV.1996.558037","url":null,"abstract":"In scientific visualization, it is necessary to visualize the distribution of a scalar field by using adjustable color maps in conjunction with a pseudo-color display. This paper proposes a method for fast direct volume rendering when color maps undergo change. The method pre-calculates basis images that are independent from the color maps. The rendered images for an arbitrary color map are then generated by compositing the basis images. The proposed method makes possible interactive observation of changing color maps with a fixed viewpoint.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125379226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Direct volume rendering with shading via three-dimensional textures","authors":"A. V. Gelder, Kwansik Kim","doi":"10.1109/SVV.1996.558039","DOIUrl":"https://doi.org/10.1109/SVV.1996.558039","url":null,"abstract":"A new and easy-to-implement method for direct volume rendering that uses 3D texture maps for acceleration, and incorporates directional lighting, is described. The implementation, called Voltx, produces high-quality images at nearly interactive speeds on workstations with hardware support for three-dimensional texture maps. Previously reported methods did not incorporate a light model, and did not address issues of multiple texture maps for large volumes. Our research shows that these extensions impact performance by about a factor of ten. Voltx supports orthographic, perspective, and stereo views. This paper describes the theory and implementation of this technique, and compares it to the shear-warp factorization approach. A rectilinear data set is converted into a three-dimensional texture map containing color and opacity information. Quantized normal vectors and a lookup table provide efficiency. A new tesselation of the sphere is described, which serves as the basis for normal-vector quantization. A new gradient-based shading criterion is described, in which the gradient magnitude is interpreted in the context of the field-data value and the material classification parameters, and not in isolation. In the rendering phase, the texture map is applied to a stack of parallel planes, which effectively cut the texture into many slabs. The slabs are composited to form an image.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123066249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cláudio T. Silva, Joseph S. B. Mitchell, A. Kaufman
{"title":"Fast rendering of irregular grids","authors":"Cláudio T. Silva, Joseph S. B. Mitchell, A. Kaufman","doi":"10.1109/SVV.1996.558038","DOIUrl":"https://doi.org/10.1109/SVV.1996.558038","url":null,"abstract":"We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (even with holes) unstructured irregular grids with a rendering cost that decreases as the \"disconnectedness\" decreases. The algorithm is carefully tailored to exploit spatial coherence even if the image resolution differs substantially from the object space resolution. In this paper, we establish the practicality of our method through experimental results based on our implementation, and we also provide theoretical results, both lower and upper bounds, on the complexity of ray casting of irregular grids.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134146726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Torsten Möller, R. Machiraju, K. Mueller, R. Yagel
{"title":"Classification and local error estimation of interpolation and derivative filters for volume rendering","authors":"Torsten Möller, R. Machiraju, K. Mueller, R. Yagel","doi":"10.1109/SVV.1996.558045","DOIUrl":"https://doi.org/10.1109/SVV.1996.558045","url":null,"abstract":"We describe a new method for analyzing, classifying, and evaluating filters, which can be applied to interpolation filters, and derivative filters. Our analysis is based on the Taylor series expansion of a convolution sum and some assumptions on the behavior of the data function. As a result of our analysis, we derive the need and the method for normalization of derivative filter coefficients. As an example, we demonstrate the utilization of our methods to the analysis of the class of cardinal cubic filters. Since our technique is not restricted to interpolation filters, we can show that the Catmull-Rom spline filter and its derivative are the most accurate reconstruction and derivative filter among this class of filters. We show that the derivative filter has a much higher impact on the rendered volume than the interpolation filter. We demonstrate the use of these optimal filters for accurate interpolation and gradient estimation in volume rendering.","PeriodicalId":168501,"journal":{"name":"Proceedings of 1996 Symposium on Volume Visualization","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133445705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}