Shadow silhouette maps

Sen, Pradeep; Cammarano, Mike; Hanrahan, Pat

doi:10.1145/1201775.882301

Cited by 51 publications

(35 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lecocq et al [38] and Sen et al [39] augment a shadow map with geometry, which can give subpixel accurate shadows. But they fail in complex texels when multiple triangles or silhouettes intersect.…”

Section: Specific Comparisons To Prior Workmentioning

confidence: 99%

Frustum-Traced Irregular Z-Buffers: Fast, Sub-Pixel Accurate Hard Shadows

Wyman

Hoetzlein

Lefohn

2016

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

We further describe and analyze a real-time system for rendering antialiased hard shadows using irregular z-buffers (IZBs) that we first presented in Wyman et al. [1]. We focus on identifying bottlenecks, exploring these from an algorithmic complexity standpoint, and presenting techniques to improve performance. Our system remains interactive on a variety of game assets and CAD models while running at resolutions 1920 1080 and above and imposes no constraints on light, camera or geometry, allowing fully dynamic scenes without precomputation. We render sub-pixel accurate, 32 sample per pixel hard shadows at roughly twice the cost of a single sample per pixel. This allows us to smoothly animate even subpixel shadows from grass or wires without introducing spatial or temporal aliasing. Prior algorithms for irregular z-buffer shadows rely heavily on the GPU's compute pipeline. Instead we leverage the standard rasterization-based graphics pipeline, including hardware conservative raster and early-z culling. Our key observation is noting a duality between irregular z-buffer performance and shadow map quality; irregular z-buffering is most costly exactly where shadow maps exhibit the worst aliasing. This allows us to use common shadow map algorithms, which typically improve aliasing, to instead reduce our cost. Compared to state of the art ray tracers, we spawn similar numbers of triangle intersections per pixel yet completely rebuild our data structure in under 1 ms per frame.

show abstract

Section: Specific Comparisons To Prior Workmentioning

confidence: 99%

Frustum-Traced Irregular Z-Buffers: Fast, Sub-Pixel Accurate Hard Shadows

Wyman

Hoetzlein

Lefohn

2016

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…Silhouette Shadow Maps (SSM) [18] is an interesting method that strives to yield clear shadow boundaries by leveraging a conventional shadow map and a silhouette map. The silhouette map stores points that lie on the silhouette of objects as seen from the light.…”

Section: Related Workmentioning

confidence: 99%

“…In the geometry shader, we also detect the geometry silhouette, which consists of edges shared by a triangle facing the light and a triangle back-facing the light. For each silhouette edge, we emit an edge primitive in a similar way depicted in SSM [18]. In the fragment shader, we write every triangle fragment into the BSM.…”

Section: A Bsm and Hrm Renderingmentioning

confidence: 99%

Multi-resolution Shadow Mapping Using CUDA Rasterizer

Huang

2013

2013 International Conference on Computer-Aided Design and Computer Graphics

View full text Add to dashboard Cite

Shadow mapping is a fast and easy to use method to produce hard shadows. However, it introduces aliasing due to its uniform sampling strategy and limited shadow map resolution. In this paper, we propose a memory efficient algorithm to render high quality shadows. Our algorithm is based on a multi-resolution shadow map structure, which includes a conventional shadow map for scene regions where a lowresolution shadow map is sufficient, and a high-resolution patch buffer to capture scene regions that are susceptible to aliasing. With this data structure, we are able to capture shadow details with far less memory footprint than conventional shadow mapping. In order to maintain an appropriate performance compared to conventional shadow mapping, we designed a customized CUDA rasterizer to render the high-resolution patches.

show abstract

“…Prior GPU schemes limit the complexity of the outline within each image cell, such as a few line segments [Sen et al 2003[Sen et al , 2004Tumblin and Choudhury 2004;Lefebvre and Hoppe 2006], an implicit bilinear curve [Tarini and Cignoni 2005;Loviscach 2005], a parametric cubic curve [Ray et al 2005], two quadratic segments [Parilov and Zorin 2008], or a fixed number of corner features [Qin et al 2006]. A drawback of fixed-complexity cells is that small areas of high detail (e.g.…”

Section: Related Workmentioning

confidence: 99%

Random-access rendering of general vector graphics

Nehab

Hoppe

2008

ACM Trans. Graph.

View full text Add to dashboard Cite

Figure 1: Given a vector graphics drawing, we locally specialize its description to each cell of a lattice, and apply both prefiltering and spatially adaptive supersampling to produce high-quality antialiased renderings over arbitrary surfaces on the GPU. AbstractWe introduce a novel representation for random-access rendering of antialiased vector graphics on the GPU, along with efficient encoding and rendering algorithms. The representation supports a broad class of vector primitives, including multiple layers of semitransparent filled and stroked shapes, with quadratic outlines and color gradients. Our approach is to create a coarse lattice in which each cell contains a variable-length encoding of the graphics primitives it overlaps. These cell-specialized encodings are interpreted at runtime within a pixel shader. Advantages include localized memory access and the ability to map vector graphics onto arbitrary surfaces, or under arbitrary deformations. Most importantly, we perform both prefiltering and supersampling within a single pixel shader invocation, achieving inter-primitive antialiasing at no added memory bandwidth cost. We present an efficient encoding algorithm, and demonstrate high-quality realtime rendering of complex, real-world examples.

show abstract

Shadow silhouette maps

Cited by 51 publications

References 11 publications

Frustum-Traced Irregular Z-Buffers: Fast, Sub-Pixel Accurate Hard Shadows

Frustum-Traced Irregular Z-Buffers: Fast, Sub-Pixel Accurate Hard Shadows

Multi-resolution Shadow Mapping Using CUDA Rasterizer

Random-access rendering of general vector graphics

Contact Info

Product

Resources

About