共查询到20条相似文献,搜索用时 15 毫秒
1.
针对纹理映射体绘制物理内存空间的限制,本文提出一种可在通用图形硬件上完成大规模数据场实时体绘制的有效方法.该方法基于满二叉树纹理分块策略,利用GPU着色器可编程性,将纹理数据制作为一个一维传递函数查找表和一个规模等同于体数据场的动态纹理工作集,有效提高了大规模数据场体绘制的实时性.动态纹理工作集使用抽象分块与继承关系管... 相似文献
2.
Recent research on high‐performance ray tracing has achieved real‐time performance even for highly complex surface models already on a single PC. In this report, we provide an overview of techniques for extending real‐time ray tracing also to interactive volume rendering. We review fast rendering techniques for different volume representations and rendering modes in a variety of computing environments. The physically‐based rendering approach of ray tracing enables high image quality and allows for easily mixing surface, volume and other primitives in a scene, while fully accounting for all of their optical interactions. We present optimized implementations and discuss the use of upcoming high‐performance processors for volume ray tracing. 相似文献
3.
Plate J Holtkaemper T Froehlich B 《IEEE transactions on visualization and computer graphics》2007,13(6):1584-1591
We present a powerful framework for 3D-texture-based rendering of multiple arbitrarily intersecting volumetric datasets. Each volume is represented by a multi-resolution octree-based structure and we use out-of-core techniques to support extremely large volumes. Users define a set of convex polyhedral volume lenses, which may be associated with one or more volumetric datasets. The volumes or the lenses can be interactively moved around while the region inside each lens is rendered using interactively defined multi-volume shaders. Our rendering pipeline splits each lens into multiple convex regions such that each region is homogenous and contains a fixed number of volumes. Each such region is further split by the brick boundaries of the associated octree representations. The resulting puzzle of lens fragments is sorted in front-to-back or back-to-front order using a combination of a view-dependent octree traversal and a GPU-based depth peeling technique. Our current implementation uses slice-based volume rendering and allows interactive roaming through multiple intersecting multi-gigabyte volumes. 相似文献
4.
Direct volume rendering (DVR) is a powerful visualization technique which allows users to effectively explore and study volumetric datasets.Different transparency settings can be flexibly assigned to different structures such that some valuable information can be revealed in direct volume rendered images (DVRIs).However,end-users often feel that some risks are always associated with DVR because they do not know whether any important information is missing from the transparent regions of DVRIs.In this paper,we investigate how to semi-automatically generate a set of DVRIs and also an animation which can reveal information missed in the original DVRIs and meanwhile satisfy some image quality criteria such as coherence.A complete framework is developed to tackle various problems related to the generation and quality evaluation of visibility-aware DVRIs and animations.Our technique can reduce the risk of using direct volume rendering and thus boost the confidence of users in volume rendering systems. 相似文献
5.
Two-level volume rendering 总被引:7,自引:0,他引:7
Hauser H. Mroz L. Italo Bischi G. Groller M.E. 《IEEE transactions on visualization and computer graphics》2001,7(3):242-252
Presents a two-level approach for volume rendering, which allows for selectively using different rendering techniques for different subsets of a 3D data set. Different structures within the data set are rendered locally on an object-by-object basis by either direct volume rendering (DVR), maximum-intensity projection (MIP), surface rendering, value integration (X-ray-like images) or non-photorealistic rendering (NPR). All the results of subsequent object renderings are combined globally in a merging step (usually compositing in our case). This allows us to selectively choose the most suitable technique for depicting each object within the data while keeping the amount of information contained in the image at a reasonable level. This is especially useful when inner structures should be visualized together with semi-transparent outer parts, similar to the focus+context approach known from information visualization. We also present an implementation of our approach which allows us to explore volumetric data using two-level rendering at interactive frame rates 相似文献
6.
Aakash KT Adrian Jarabo Carlos Aliaga Matt Jen-Yuan Chiang Olivier Maury Christophe Hery P. J. Narayanan Giljoo Nam 《Computer Graphics Forum》2023,42(4):e14895
Efficiently and accurately rendering hair accounting for multiple scattering is a challenging open problem. Path tracing in hair takes long to converge while other techniques are either too approximate while still being computationally expensive or make assumptions about the scene. We present a technique to infer the higher order scattering in hair in constant time within the path tracing framework, while achieving better computational efficiency. Our method makes no assumptions about the scene and provides control over the renderer's bias & speedup. We achieve this by training a small multilayer perceptron (MLP) to learn the higher-order radiance online, while rendering progresses. We describe how to robustly train this network and thoroughly analyze our resulting renderer's characteristics. We evaluate our method on various hairstyles and lighting conditions. We also compare our method against a recent learning based & a traditional real-time hair rendering method and demonstrate better quantitative & qualitative results. Our method achieves a significant improvement in speed with respect to path tracing, achieving a run-time reduction of 40%-70% while only introducing a small amount of bias. 相似文献
7.
Callahan SP Bavoil L Pascucci V Silva CT 《IEEE transactions on visualization and computer graphics》2006,12(5):1307-1314
We describe a new progressive technique that allows real-time rendering of extremely large tetrahedral meshes. Our approach uses a client-server architecture to incrementally stream portions of the mesh from a server to a client which refines the quality of the approximate rendering until it converges to a full quality rendering. The results of previous steps are re-used in each subsequent refinement, thus leading to an efficient rendering. Our novel approach keeps very little geometry on the client and works by refining a set of rendered images at each step. Our interactive representation of the dataset is efficient, light-weight, and high quality. We present a framework for the exploration of large datasets stored on a remote server with a thin client that is capable of rendering and managing full quality volume visualizations. 相似文献
8.
Timo Ropinski Jennis Meyer-Spradow Stefan Diepenbrock Jörg Mensmann Klaus Hinrichs 《Computer Graphics Forum》2008,27(2):567-576
We propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In contrast to ambient occlusion approaches for polygonal data, techniques for volumetric data sets have to face additional challenges, since by changing rendering parameters, such as the transfer function or the thresholding, the structure of the data set and thus the light interactions may vary drastically. Therefore, during a preprocessing step which is independent of the rendering parameters we capture light interactions for all combinations of structures extractable from a volumetric data set. In order to compute the light interactions between the different structures, we combine this preprocessed information during rendering based on the rendering parameters defined interactively by the user. Thus our method supports interactive exploration of a volumetric data set but still gives the user control over the most important rendering parameters. For instance, if the user alters the transfer function to extract different structures from a volumetric data set the light interactions between the extracted structures are captured in the rendering while still allowing interactive frame rates. Compared to known local illumination models for volume rendering our method does not introduce any substantial rendering overhead and can be integrated easily into existing volume rendering applications. In this paper we will explain our approach, discuss the implications for interactive volume rendering and present the achieved results. 相似文献
9.
Müller T Grottel S Weiskopf D 《IEEE transactions on visualization and computer graphics》2010,16(6):1243-1250
Special relativistic visualization offers the possibility of experiencing the optical effects of traveling near the speed of light, including apparent geometric distortions as well as Doppler and searchlight effects. Early high-quality computer graphics images of relativistic scenes were created using offline, computationally expensive CPU-side 4D ray tracing. Alternate approaches such as image-based rendering and polygon-distortion methods are able to achieve interactivity, but exhibit inferior visual quality due to sampling artifacts. In this paper, we introduce a hybrid rendering technique based on polygon distortion and local ray tracing that facilitates interactive high-quality visualization of multiple objects moving at relativistic speeds in arbitrary directions. The method starts by calculating tight image-space footprints for the apparent triangles of the 3D scene objects. The final image is generated using a single image-space ray tracing step incorporating Doppler and searchlight effects. Our implementation uses GPU shader programming and hardware texture filtering to achieve high rendering speed. 相似文献
10.
D. Bernabei F. Ganovelli N. Pietroni P. Cignoni S. Pattanaik R. Scopigno 《The Visual computer》2010,26(6-8):583-593
In this paper we propose a novel technique to perform real-time rendering of translucent inhomogeneous materials, one of the most well-known problems of computer graphics. The developed technique is based on an adaptive volumetric point sampling, done in a preprocessing stage, which associates to each sample the optical depth for a predefined set of directions. This information is then used by a rendering algorithm that combines the object’s surface rasterization with a ray tracing algorithm, implemented on the graphics processor, to compose the final image. This approach allows us to simulate light scattering phenomena for inhomogeneous isotropic materials in real time with an arbitrary number of light sources. We tested our algorithm by comparing the produced images with the result of ray tracing and showed that the technique is effective. 相似文献
11.
State of the Art in Ray Tracing Animated Scenes 总被引:1,自引:0,他引:1
Ingo Wald William R. Mark Johannes Günther Solomon Boulos Thiago Ize Warren Hunt Steven G. Parker Peter Shirley 《Computer Graphics Forum》2009,28(6):1691-1722
Ray tracing has long been a method of choice for off-line rendering, but traditionally was too slow for interactive use. With faster hardware and algorithmic improvements this has recently changed, and real-time ray tracing is finally within reach. However, real-time capability also opens up new problems that do not exist in an off-line environment. In particular real-time ray tracing offers the opportunity to interactively ray trace moving/animated scene content.
This presents a challenge to the data structures that have been developed for ray tracing over the past few decades. Spatial data structures crucial for fast ray tracing must be rebuilt or updated as the scene changes, and this can become a bottleneck for the speed of ray tracing. This bottleneck has recently received much attention by researchers and that has resulted in a multitude of different algorithms, data structures and strategies for handling animated scenes. The effectiveness of techniques for ray tracing dynamic scenes vary dramatically depending on details such as scene complexity, model structure, type of motion and the coherency of the rays. Consequently, there is so far no approach that is best in all cases, and determining the best technique for a particular problem can be a challenge. In this State of the Art Report (STAR), we aim to survey the different approaches to ray tracing animated scenes, discussing their strengths and weaknesses, and their relationship to other approaches. The overall goal is to help the reader choose the best approach depending on the situation, and to expose promising areas where there is potential for algorithmic improvements. 相似文献
This presents a challenge to the data structures that have been developed for ray tracing over the past few decades. Spatial data structures crucial for fast ray tracing must be rebuilt or updated as the scene changes, and this can become a bottleneck for the speed of ray tracing. This bottleneck has recently received much attention by researchers and that has resulted in a multitude of different algorithms, data structures and strategies for handling animated scenes. The effectiveness of techniques for ray tracing dynamic scenes vary dramatically depending on details such as scene complexity, model structure, type of motion and the coherency of the rays. Consequently, there is so far no approach that is best in all cases, and determining the best technique for a particular problem can be a challenge. In this State of the Art Report (STAR), we aim to survey the different approaches to ray tracing animated scenes, discussing their strengths and weaknesses, and their relationship to other approaches. The overall goal is to help the reader choose the best approach depending on the situation, and to expose promising areas where there is potential for algorithmic improvements. 相似文献
12.
A good transfer function in volume rendering requires careful consideration of the materials present in a volume. A manual creation is tedious and prone to errors. Furthermore, the user interaction to design a higher dimensional transfer function gets complicated. In this work, we present a graph-based approach to design a transfer function that takes volumetric structures into account. Our novel contribution is in proposing an algorithm for robust deduction of a material graph from a set of disconnected edges. We incorporate stable graph creation under varying noise levels in the volume. We show that the deduced material graph can be used to automatically create a transfer function using the occlusion spectrum of the input volume. Since we compute material topology of the objects, an enhanced rendering is possible with our method. This also allows us to selectively render objects and depict adjacent materials in a volume. Our method considerably reduces manual effort required in designing a transfer function and provides an easy interface for interaction with the volume. 相似文献
13.
This paper introduces a caching technique based on a volumetric representation that captures low-frequency indirect illumination.
This structure is intended for efficient storage and manipulation of illumination. It is based on a 3D grid that stores a
fixed set of irradiance vectors. During preprocessing, this representation can be built using almost any existing global illumination
software. During rendering, the indirect illumination within a voxel is interpolated from its associated irradiance vectors,
and is used as additional local light sources. Compared with other techniques, the 3D vector-based representation of our technique
offers increased robustness against local geometric variations of a scene. We thus demonstrate that it may be employed as
an efficient and high-quality caching data structure for bidirectional rendering techniques such as particle tracing or photon
mapping. 相似文献
14.
提出一种新的基于图像的绘制方法——边界光场.该方法基于3D全光函数的思想,并使之与场景几何相结合.该方法克服了已有的IBR漫游系统的一些缺陷,利用自适应的的全光采样模式,根据场景复杂度或用户要求组织采样数据,降低了场景数据量;由于场景几何的参与,纠正了较大的深度变形;新的采样数据组织模式去除了对漫游范围的限制.文中方法可有效地应用于虚拟或真实场景漫游系统中. 相似文献
15.
A single-pass GPU ray casting framework for interactive out-of-core rendering of massive volumetric datasets 总被引:1,自引:0,他引:1
Enrico Gobbetti Fabio Marton José Antonio Iglesias Guitián 《The Visual computer》2008,24(7-9):797-806
We present an adaptive out-of-core technique for rendering massive scalar volumes employing single-pass GPU ray casting. The method is based on the decomposition of a volumetric dataset into small cubical bricks, which are then organized into an octree structure maintained out-of-core. The octree contains the original data at the leaves, and a filtered representation of children at inner nodes. At runtime an adaptive loader, executing on the CPU, updates a view and transfer function-dependent working set of bricks maintained on GPU memory by asynchronously fetching data from the out-of-core octree representation. At each frame, a compact indexing structure, which spatially organizes the current working set into an octree hierarchy, is encoded in a small texture. This data structure is then exploited by an efficient stackless ray casting algorithm, which computes the volume rendering integral by visiting non-empty bricks in front-to-back order and adapting sampling density to brick resolution. Block visibility information is fed back to the loader to avoid refinement and data loading of occluded zones. The resulting method is able to interactively explore multi-gigavoxel datasets on a desktop PC. 相似文献
16.
Weiskopf D Borchers M Ertl T Falk M Fechtig O Frank R Grave F King A Kraus U Müller T Nollert HP Rica Mendez I Ruder H Schafhitzel T Schär S Zahn C Zatloukal M 《IEEE transactions on visualization and computer graphics》2006,12(4):522-534
This paper describes methods for explanatory and illustrative visualizations used to communicate aspects of Einstein's theories of special and general relativity, their geometric structure, and of the related fields of cosmology and astrophysics. Our illustrations target a general audience of laypersons interested in relativity. We discuss visualization strategies, motivated by physics education and the didactics of mathematics, and describe what kind of visualization methods have proven to be useful for different types of media, such as still images in popular science magazines, film contributions to TV shows, oral presentations, or interactive museum installations. Our primary approach is to adopt an egocentric point of view: the recipients of a visualization participate in a visually enriched thought experiment that allows them to experience or explore a relativistic scenario. In addition, we often combine egocentric visualizations with more abstract illustrations based on an outside view in order to provide several presentations of the same phenomenon. Although our visualization tools often build upon existing methods and implementations, the underlying techniques have been improved by several novel technical contributions like image-based special relativistic rendering on GPUs, special relativistic 4D ray tracing for accelerating scene objects, an extension of general relativistic ray tracing to manifolds described by multiple charts, GPU-based interactive visualization of gravitational light deflection, as well as planetary terrain rendering. The usefulness and effectiveness of our visualizations are demonstrated by reporting on experiences with, and feedback from, recipients of visualizations and collaborators. 相似文献
17.
Guetat A Ancel A Marchesin S Dischler JM 《IEEE transactions on visualization and computer graphics》2010,16(6):1487-1494
Shading is an important feature for the comprehension of volume datasets, but is difficult to implement accurately. Current techniques based on pre-integrated direct volume rendering approximate the volume rendering integral by ignoring non-linear gradient variations between front and back samples, which might result in cumulated shading errors when gradient variations are important and / or when the illumination function features high frequencies. In this paper, we explore a simple approach for pre-integrated volume rendering with non-linear gradient interpolation between front and back samples. We consider that the gradient smoothly varies along a quadratic curve instead of a segment in-between consecutive samples. This not only allows us to compute more accurate shaded pre-integrated look-up tables, but also allows us to more efficiently process shading amplifying effects, based on gradient filtering. An interesting property is that the pre-integration tables we use remain two-dimensional as for usual pre-integrated classification. We conduct experiments using a full hardware approach with the Blinn-Phong illumination model as well as with a non-photorealistic illumination model. 相似文献
18.
Complex repetitive scenes containing forests, foliage, grass, hair, or fur, are challenging for common modeling and rendering tools. The amount of data, the tediousness of modeling and animation tasks, and the cost of realistic rendering have caused such kind of scene to see only limited use even in high-end productions. The author describes how the use of volumetric textures is well suited to such scenes. These primitives can greatly simplify modeling and animation tasks. More importantly, they can be very efficiently rendered using ray tracing with few aliasing artifacts. The main idea, initially introduced by Kajiya and Kay (1989), is to represent a pattern of 3D geometry in a reference volume, that is tiled over an underlying surface much like a regular 2D texture. In our contribution, the mapping is independent of the mesh subdivision, the pattern can contain any kind of shape, and it is prefiltered at different scales as for MIP-mapping. Although the model encoding is volumetric, the rendering method differs greatly from traditional volume rendering. A volumetric texture only exists in the neighborhood of a surface, and the repeated instances (called texels) of the reference volume are spatially deformed. Furthermore, each voxel of the reference volume contains a key feature which controls the reflectance function that represents aggregate intravoxel geometry. This allows for ray tracing of highly complex scenes with very few aliasing artifacts, using a single ray per pixel (for the part of the scene using the volumetric texture representation). The major technical considerations of our method lie in the ray-path determination and in the specification of the reflectance function 相似文献
19.
Pascal Gautron Cyril Delalandre Jean‐Eudes Marvie Pascal Lecocq 《Computer Graphics Forum》2013,32(7):305-314
We introduce Boundary‐Aware Extinction Maps for interactive rendering of massive heterogeneous volumetric datasets. Our approach is based on the projection of the extinction along light rays into a boundary‐aware function space, focusing on the most relevant sections of the light paths. This technique also provides an alternative representation of the set of participating media, allowing scattering simulation methods to be applied on arbitrary volume representations. Combined with a simple out‐of‐core rendering framework, Boundary‐Aware Extinction Maps are valuable tools for interactive applications as well as production previsualization and rendering. 相似文献