Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware最新文献_第2页

Prefiltered antialiased lines using half-plane distance functions 使用半平面距离函数预滤波抗锯齿线

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 2000-08-01 DOI: 10.1145/346876.348226

Bob McNamara, Joel McCormack, N. Jouppi

{"title":"Prefiltered antialiased lines using half-plane distance functions","authors":"Bob McNamara, Joel McCormack, N. Jouppi","doi":"10.1145/346876.348226","DOIUrl":"https://doi.org/10.1145/346876.348226","url":null,"abstract":"We describe a method to compute high-quality antialiased lines by adding a modest amount of hardware to a fragment generator based upon half-plane edge functions. (A fragment contains the information needed to paint one pixel of a line or a polygon.) We surround an antialiased line with four edge functions to create a long, thin, rectangle. We scale the edge functions so that they compute signed distances from the four edges. At each fragment within the antialiased line, the four distances to the fragment are combined and the result indexes an intensity table. The table is computed by convolving a filter kernel with a prototypical line at various distances from the line's edge. Because the convolutions aren't performed in hardware, we can use wider, more complex filters with better high-frequency rejection than the narrow box filter common to supersampling antialiasing hardware. The result is smoother antialiased lines. Our algorithm is parameterized by the line width and filter radius. These parameters do not affect the rendering algorithm, but only the setup of the edge functions. Our algorithm antialiases line endpoints without special handling. We exploit this to paint small blurry squares as approximations to small antialiased round points. We do not need a different fragment generator for antialiased lines, and so can take advantage of all optimizations introduced in the existing fragment generator.","PeriodicalId":298241,"journal":{"name":"Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware","volume":"97 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486970","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}

引用次数: 16

Interactive volume on standard PC graphics hardware using multi-textures and multi-stage rasterization 在标准PC图形硬件上使用多纹理和多阶段光栅化的交互式卷

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 2000-08-01 DOI: 10.1145/346876.348238

C. Rezk-Salama, Klaus Engel, M. Bauer, G. Greiner, T. Ertl

引用次数: 307

GI-cube: an architecture for volumetric global illumination and rendering GI-cube:用于体积全局照明和渲染的架构

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 2000-08-01 DOI: 10.1145/346876.348241

F. Dachille, A. Kaufman

引用次数: 27

Single-pass full-screen hardware accelerated antialiasing 单次全屏硬件加速抗锯齿

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 2000-08-01 DOI: 10.1145/346876.348225

Jin-Aeon Lee, L. Kim

引用次数: 14

A low-cost memory architecture for PCI-based interactive ray casting 一种基于pci的交互式光线投射的低成本存储器体系结构

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 1999-07-01 DOI: 10.1145/311534.311566

M. Doggett, M. Meissner, Urs Kanus

引用次数: 9

TriangleCaster: extensions to 3D-texturing units for accelerated volume rendering TriangleCaster:扩展到3d纹理单位加速体渲染

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 1999-07-01 DOI: 10.1145/311534.311570

G. Knittel

引用次数: 7

Fast footprint MIPmapping 快速占用MIPmapping

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 1999-07-01 DOI: 10.1145/311534.311572

Tobias Hüttner, W. Straßer

引用次数: 21

Hybrid volume and polygon rendering with cube hardware 混合体和多边形渲染与立方体硬件

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 1999-07-01 DOI: 10.1145/311534.311568

K. Kreeger, A. Kaufman

{"title":"Hybrid volume and polygon rendering with cube hardware","authors":"K. Kreeger, A. Kaufman","doi":"10.1145/311534.311568","DOIUrl":"https://doi.org/10.1145/311534.311568","url":null,"abstract":"Hybrid Volume and Polygon Rendering with Cube Hardware Kevin Kreeger and Arie Kaufman* Center for Visual Computing (CVC) and Department of Computer Science State University of New York at Stony Brook Stony Brook, NY 11794-4400 We present two methods which connect today’s polygon graphics hardware accelerators to Cube-5 volume rendering hardware, the successor to Cube4 The proposed methods allow mixing of both opaque and translucent polygons with volumes on PC class machines, while ensuring the correct compositing order of all objects. Both implementations connect the two hardware acceleration subsystems at the frame buffer. One shares a common DRAM buffer and one run-length encodes images of thin slabs of polygonal data and then combines them in the Cube composite buffer In both realizations, we take advantage of the predictable ordered access to frame buffer storage that is utilized by Cube-5 and the rest of the family of volume rendering accelerators based on the Cube design. CR Categories: 1.3.1 [Computer Graphics]: Hardware Architecture-Graphics Processors; 1.3.3 [Computer Graphics]: Picture/Image Generation-Display algorithms; 1.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism;","PeriodicalId":298241,"journal":{"name":"Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125977740","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}

引用次数: 23

Multiresolution rendering with displacement mapping 多分辨率渲染与位移映射

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 1999-07-01 DOI: 10.1145/311534.311578

S. Gumhold, Tobias Hüttner

{"title":"Multiresolution rendering with displacement mapping","authors":"S. Gumhold, Tobias Hüttner","doi":"10.1145/311534.311578","DOIUrl":"https://doi.org/10.1145/311534.311578","url":null,"abstract":"In this paper, we present for the first time an approach for hardware accelerated displacement mapping. The displaced surface is generated from a 2D displacement map by remeshing a coarse triangle mesh according to the screen projection of the surface. The remeshing algorithm is implemented in hardware. Filtered access to the displacement map makes our approach competitive with available view dependent multiresolution techniques. The advantage of displacement mapping is the compact representation. A displacement mapped surface consumes together with all filter levels only a fraction of the storage space needed for a hardware compatible representation of an equivalent triangle mesh. A possible design of the displacement mapping rendering pipeline is proposed. Previously described hardware components are used as often as possible. Our approach can be smoothly integrated into all available graphics application programming interfaces. Most existing graphics applications can be extended to the new feature with marginal effort. CR Categories: I.3.1 [Computer Graphics]: Hardware Architecture—Raster display devices I.3.3 [Computer Graphics]: Picture/Image Generation—Bitmap and framebuffer operations, Display algorithms, Viewing algorithms I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Curve, surface, solid, and object representations I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism—Color, shading, shadowing, and texture","PeriodicalId":298241,"journal":{"name":"Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware","volume":"68 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134128207","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}

引用次数: 48

Optimal depth buffer for low-cost graphics hardware 低成本图形硬件的最佳深度缓冲

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware Pub Date : 1999-07-01 DOI: 10.1145/311534.311579

Eugene Lapidous, Guofang Jiao

{"title":"Optimal depth buffer for low-cost graphics hardware","authors":"Eugene Lapidous, Guofang Jiao","doi":"10.1145/311534.311579","DOIUrl":"https://doi.org/10.1145/311534.311579","url":null,"abstract":"3D applications using hardware depth buffers for visibility testing are confronted with multiple choices of buffer types, sizes and formats. Some of the options are not exposed through 3D API or may be used by the driver without application’s knowledge. As a result, it becomes increasingly diffkult to select depth buffer optimal for desired balance between performance and precision. In this paper we provide comparative evaluation of depth precision for main depth buffer types with different size and format combinations. Results indicate that integer storage is preferred for some buffer types, while others achieve maximal depth resolution with floating-point format optimized for known scene parameters. We propose to give 3D applications full control of the depth buffer optimization by supporting multiple storage formats with the same buffer size and exposing them in 3D API. In the search for a unified depth buffer solution, we describe new type of the depth buffer and compare it with other options. Complementary floating-point Z buffer is a combination of a reversed-direction Z buffer and an optimal floating-point storage format. Non-linear mapping and storage format compensate each other’s effect on the depth precision; as a result, depth errors become significantly less dependent on the eye-space distance, improving depth resolution by the orders of magnitude in comparison with standard Z buffer. Results show that complementary Z buffer is also superior to inverse W buffer at any storage size. At 16 and 24 bits/pixel, average depth errors of complementary Z buffer remain 2 times larger than for true W buffer utilizing expensive high-precision per-pixel division. However, it provides absolutely best precision at 32 bits/pixel, when errors are limited by floating-point per-vertex input. Results suggest that complementary floating-point Z buffer can be considered as a candidate for replacement of both screen Z and inverse W buffers, at the same time making hardware investment in the true W buffer support less attractive. CR","PeriodicalId":298241,"journal":{"name":"Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132943026","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}

引用次数: 23