多层阴影图轮廓边背投软影算法

在场景深度和物体分布复杂时,针对轮廓边背投软影算法中的可见性因子计算存在误差,从而导致过阴影和光渗等绘制瑕疵的问题,提出一种基于掩码的多层阴影图遮挡物轮廓边背投软影算法.该算法通过计算光源掩码的深度复杂函数获得更准确的可见性因子,解决了轮廓边背投软影算法中存在的过阴影问题;将光源掩码计算与多层阴影图结合以解决光渗问题,最终生成更高质量的光滑软影.实验结果表明,在保证绘制效率的前提下,文中算法可以产生更为准确、真实的软影效果.     

利用反向投影实现的实时软阴影映射算法

基于阴影映射算法,提出一种利用反向投影实现的实时软阴影的新算法。算法对每个光源都产生对应的阴影图,使用阴影图作为对场景的离散化表示,引入可见因子来计算场景点的亮度信息,并采用GPU片元着色、层次阴影图、自适应精度等方法加速阴影渲染。实验表明,算法非常适合于实时渲染复杂、动态的场景,可以很好地处理遮挡物的融合,并且很容易在可编程图形硬件上实现。     

方差阴影图中的光渗现象消除算法

方差阴影图算法使用概率的方法计算像素被遮挡的上限概率,通过对深度图滤波的方法来有效地减少阴影图算法中的走样问题,但在深度比较复杂的场景中方差阴影图算法会出现光渗现象,即在应该是阴影的区域却有了亮度.文中使用最小-最大阴影图来辅助消除方差阴影图中的光渗现象,在对深度纹理进行滤波的同时生成一个最小-最大阴影图;在实时绘制场景时,利用最小-最大阴影图来辅助判断当前片元是否完全处在阴影区域内部,由此生成更真实、更准确的阴影.该算法可以很容易地添加到已有的方差阴影图算法的片元处理程序中,并且不会对原有阴影的柔和边界以及绘制的帧率产生影响.     

视野驱动的自适应阴影图

阴影图是当前实时阴影绘制中的一种经典算法。该算法基于图像空间,当有限分辨率的阴影图映射到较大场景中时,就会由于采样不足造成锯齿形变走样。提出了一种实时的反走样阴影图算法,该算法首先获取当前视点所能够看到的场景范围,然后绘制该范围内的阴影图,并映射到场景中生成实时阴影。该方法同经典的阴影图算法相比,避免了场景中不必要的阴影绘制,提高了阴影图的利用率,反走样的效果很好。而且,该方法只需要绘制一到两幅阴影图,算法的实时性很强,可以满足一个上百万面片的大规模场景中实时阴影绘制的需要。     

软阴影算法及实现

提出了一个实时软阴影算法。首先以光源为视点生成包含场景深度信息的“阴影映射图”,然后从观察者视点将场景渲染到一个屏幕纹理缓冲中,进而对此纹理采用percentage closer filtering (PCF)策略进行反走样,最后采用高斯滤波对阴影进行模糊处理。该算法不仅得到了较好的软阴影效果,并且也有较好的实时性,可适应实时动态变化场景的需求。     

高质量快速百分比邻近滤波软影算法

在基于实时绘制的各种应用中,百分比邻近滤波软影算法可以高效地绘制视觉真实的软影效果.针对该算法中存在的3个主要问题,提出一种具有高质量阴影滤波的高效百分比邻近滤波软影算法.首先通过多尺度阴影图数据结构精简搜索区域,提升了遮挡物深度估计的正确性;然后使用基于GPU的线性四叉树遍历算法快速计算遮挡物平均深度,节省了大量的纹理采样开销,大大提高算法效率;最后采用光滑阴影滤波算法,解决了百分比邻近滤波算法中的走样瑕疵.将文中算法集成入多阴影图算法框架可以取得接近物理真实的软影效果.实验结果表明,该算法在效率和阴影质量方面均取得了显著的进步.     

基于高度梯度图的微结构表面阴影绘制方法

针对带有微结构表面的几何模型建模困难、模型复杂度高,导致现有阴影绘制算法效率差的问题,提出一种基于高度梯度图的阴影实时绘制方法.为实现实时渲染,首先给出一种微结构描述模型,通过将微结构高度场映射到低精度模型表面来描述复杂微结构模型;然后定义微结构高度梯度图,并据此构建可见点的局部最高点集合.在阴影绘制阶段,通过实时计算梯度空间局部最高点集合遮挡来生成细节阴影.整个阴影绘制算法在图像空间完成,较好地利用了延迟着色的思想和GPU并行计算的特点,可呈现可变形物体在动态场景中的自阴影效果.     

自适应采样与融合的增强现实阴影生成算法

针对现有增强现实(AR)应用中阴影生成算法绘制软阴影的真实性不足,提出一种自适应采样与背景融合的阴影生成算法。首先结合考虑遮挡的平面阴影算法计算虚拟对象投影阴影的空间位置分布;其次,改进膨胀腐蚀算法中软阴影的生成过程,提出一种依据近似点光源的形状类型进行自适应采样,从而获取假想点光源集合的软阴影绘制方法;最后,针对基于膨胀腐蚀算法使用阴影灰度图方法造成阴影的颜色被限制在单通道上,提出基于多通道与背景融合的方法。实验结果表明所提算法计算软阴影的颜色更加合理,软阴影的绘制方法更为有效,提高了阴影生成算法绘制软阴影的真实性。     

基于GPU的大规模场景实时阴影绘制

阴影绘制中,阴影图算法因不依赖于场景,绘制效率高已成为了大规模实时阴影绘制的主流算法。针对平行分割阴影图算法存在首个分割区域过小,而方差阴影图存在"光渗"问题,细致分析了在大规模场景中,实时阴影绘制的各种改进算法,提出了一种基于平行分割阴影图算法和方差阴影图算法结合的混合算法。实验结果表明,新的混合算法既提高了阴影绘制效率,又明显改善了阴影的质量。     

一种适合于MMOG的快速动态场景软阴影绘制算法

为满足MMOG实时交互的需要,该文在分析了影响动态场景软阴影算法效率的主要因素之后,提出一种适合于MMOG的快速软阴影算法。该算法利用包围盒可以用较少的点描述物体位置信息的特点,快速地计算出遮光物体与光源和接收面之间的距离关系,确定半影区的宽度和位置,避免了求平均深度值的耗时计算。经与使用平均深度值作为遮挡物距离的经典软阴影算法通过实验进行比较,本方法可以更好地满足MMOG对于实时性的要求,同时不产生明显的视觉失真。     

深度剥离与GPU结合的近似软影算法

针对基于阴影图算法扩展的一些近似软影算法中存在的只考虑外半影区而导致的本影区过多估计的问题,提出了一种深度剥离与GPU结合的近似软影实时绘制算法。算法利用GPU的几何着色器来提取场景物体的轮廓边并生成内半影和外半影图元,进而得到整个内外半影颜色图和深度图,最终阴影绘制的时候通过参考阴影图和内外半影图来确定每个可见像素的明暗值,从而得到比以往算法较真实的绘制效果,算法完全在GPU中实现。实验结果表明,对相对不复杂的场景,该算法可以生成较真实的软影效果,且绘制帧率完全达到实时。     

High-Quality Adaptive Soft Shadow Mapping

The recent soft shadow mapping technique [ [GBP06] ] allows the rendering in real-time of convincing soft shadows on complex and dynamic scenes using a single shadow map. While attractive, this method suffers from shadow overestimation and becomes both expensive and approximate when dealing with large penumbrae. This paper proposes new solutions removing these limitations and hence providing an efficient and practical technique for soft shadow generation. First, we propose a new visibility computation procedure based on the detection of occluder contours, that is more accurate and faster while reducing aliasing. Secondly, we present a shadow map multi-resolution strategy keeping the computation complexity almost independent on the light size while maintaining high-quality rendering. Finally, we propose a view-dependent adaptive strategy, that automatically reduces the screen resolution in the region of large penumbrae, thus allowing us to keep very high frame rates in any situation.     

Light Space Cascaded Shadow Maps Algorithm for Real Time Rendering

Owing to its generality and efficiency.Cascaded Shadow Maps(CSMs) has an important role in real-time shadow rendering in large scale and complex virtual environments.However,CSMs suffers from redundant rendering problem—objects are rendered undesirably to different shadow map textures when view direction and light direction are not perpendicular.In this paper,we present a light space cascaded shadow maps algorithm.The algorithm splits a scene into non-intersecting layers in light space,and generates one shadow map for each layer through irregular frustum clipping and scene organization,ensuring that any shadow sample point never appears in multiple shadow maps.A succinct shadow determination method is given to choose the optimal shadow map when rendering scenes.We also combine the algorithm with stable cascaded shadow maps and soft shadow algorithm to avoid shadow flicking and produce soft shadows.The results show that the algorithm effectively improves the efficiency and shadow quality of CSMs by avoiding redundant rendering. and can produce high-quality shadow rendering in large scale dynamic environments with real-time performance.     

Occlusion culling and z-fail for soft shadow volume algorithms

This paper presents a significant improvement of our previously proposed soft shadow volume algorithm for simulating soft shadows. By restructuring the algorithm, we can considerably simplify the computations, introduce efficient occlusion culling with speedups of 3–4 times, thus approaching real-time performance. We can also generalize the algorithm to produce correct shadows even when the eye is inside a shadowed region (using z-fail). We present and evaluate a three pass implementation of the restructured algorithm for near real-time rendering of soft shadows on a computer with a commodity graphics accelerator. However, preferably the rendering of the wedges should be implemented in hardware, and for this we suggest and evaluate a single pass algorithm.     

融合阴影图和深度划分阴影体的阴影渲染算法

阴影图算法可以简单、快速地渲染硬阴影,但该算法渲染的硬阴影会在边缘区域出现锯齿状走样。受此影响,基于阴影图算法渲染的柔和阴影,在小尺寸半影区域依然可能会出现锯齿状走样。因此,要渲染无走样的柔和阴影,需要精确计算阴影边缘区域的着色点对点光源的可见性。深度划分阴影体算法可以精确地计算着色点对点光源的可见性,但其不仅在效率上不及阴影图算法,还无法实现柔和阴影渲染。针对上述问题,提出一种融合阴影图和深度划分阴影体的阴影渲染算法,对处于阴影边缘区域的着色点,使用深度划分阴影体算法精确计算该着色点对点光源的可见性;对其他着色点,使用阴影图算法快速计算该着色点对点光源的可见性。最后,将着色点的可见性值存储在可见性图中并滤波即可实现无走样柔和阴影的渲染。     

A survey of shadow algorithms

The various types of shadows are characterized. Most existing shadow algorithms are described, and their complexities, advantages, and shortcomings are discussed. Hard shadows, soft shadows, shadows of transparent objects, and shadows for complex modeling primitives are considered. For each type, shadow algorithms within various rendering techniques are examined. The aim is to provide readers with enough background and insight on the various methods to allow them to choose the algorithm best suited to their needs and to help identify the areas that need more research and point to possible solutions     

Revectorization-Based Soft Shadow Mapping

In this paper, we present revectorization-based soft shadow mapping, an algorithm that enables the rendering of visually plausible anti-aliased soft shadows in real time. In revectorization-based shadow mapping, shadow silhouettes are anti-aliased and filtered on the basis of a discontinuity space. By replacing the filtering step of the theoretical framework of the percentage-closer soft shadow algorithm by a revectorization-based filtering algorithm, we are able to provide anti-aliasing mainly for near contact shadows or small penumbra sizes generated from low-resolution shadow maps. Moreover, we present a screen-space variant of our technique that generates visually plausible soft shadows with an overhead of only in processing time, when compared to the fastest soft shadow algorithms proposed in the literature, but that introduces shadow overestimation artefacts in the final rendering.     

Soft Shadow Maps: Efficient Sampling of Light Source Visibility

Shadows, particularly soft shadows, play an important role in the visual perception of a scene by providing visual cues about the shape and position of objects. Several recent algorithms produce soft shadows at interactive rates, but they do not scale well with the number of polygons in the scene or only compute the outer penumbra. In this paper, we present a new algorithm for computing interactive soft shadows on the GPU. Our new approach provides both inner‐ and outer‐penumbra for a modest computational cost, providing interactive frame‐rates for models with hundreds of thousands of polygons. Our technique is based on a sampled image of the occluders, as in shadow map techniques. These shadow samples are used in a novel manner, computing their effect on a second projective shadow texture using fragment programs. In essence, the fraction of the light source area hidden by each sample is accumulated at each texel position of this Soft Shadow Map. We include an extensive study of the approximations caused by our algorithm, as well as its computational costs.     

Bitmask Soft Shadows

Recently, several real-time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The resulting micropatches are backprojected onto the light source and the light areas occluded by them get accumulated to estimate overall light occlusion. This approach ignores patch overlaps, however, which can lead to objectionable artifacts. In this paper, we propose to determine the visibility of the light source with a bit field where each bit tracks the visibility of a sample point on the light source. This approach not only avoids overlapping-related artifacts but offers a solution to the important occluder fusion problem. Hence, it also becomes possible to correctly incorporate information from multiple depth maps. In addition, a new interpretation of the shadow map data is suggested which often provides superior visual results. Finally, we show how the search area for potential occluders can be reduced substantially.