Skip to main content

A Cost-Effective Supersampling for Full Scene AntiAliasing

  • Conference paper
Advances in Computer Systems Architecture (ACSAC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3189))

Included in the following conference series:

  • 362 Accesses

Abstract

We present a graphics hardware system to implement supersampling cost-effectively. Supersampling is the well-known technique to produce high quality images. However, rendering the scene at a higher resolution requires a large amount of memory size and memory bandwidth. Such costs can be alleviated by grouping subpixels into a fragment with a coverage mask which indicates which part of the pixel is covered. However, this may cause color distortion when several objects either overlap or intersect with each other within a pixel. In order to minimize such errors, we introduce an extra buffer, called the RuF(Recently used Fragment)-buffer, for storing the footprint of a fragment most recently used in the color manipulation. In our experiments, the proposed system can produce high quality images as good as supersampling with a smaller amount of memory size and memory bandwidth, compared with the conventional supersampling.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aila, F., Miettine, V., Nord, P.: Delay Streams for Graphics Hardware. ACM Transactions on Graphics 22, 792–800 (2003)

    Article  Google Scholar 

  2. Akeley, K.: RealityEngine graphics. Computer Graphics (SIGGRAPH 1993) 27, 109–116 (1993)

    Google Scholar 

  3. Carpenter, L.: The A-buffer: an Antialiased Hidden Surface Method. Computer Graphics (SIGGRAPH 1984) 18, 103–108 (1984)

    Article  Google Scholar 

  4. Haeberli, P.E., Akeley, K.: The Accumulation Buffer: Hardware Support for High- Quality Rendering. Computer Graphics (SIGGRAPH 1990) 24, 309–318 (1990)

    Article  Google Scholar 

  5. Jouppi, N.P., Chang, C.F.: Z3: an Economical Hardware Technique for High-quality Antialiasing and Transparency. In: Proceeding of Graphics hardware, pp. 85–93 (1993)

    Google Scholar 

  6. Lee, J.A., Kim, L.S.: Single-Pass Full-Screen Hardware Accelerated Antialiasing. In: Proceeding of Graphics hardware, pp. 67–75 (2000)

    Google Scholar 

  7. The Mesa 3D Graphics Library, http://www.mesa3d.org

  8. Watt, A.: 3D Computer Graphics, 3rd edn. Addison-Wesley, Reading (2000)

    Google Scholar 

  9. Wittenbrink, C.M.: R-Buffer: A Pointless A-Buffer Hardware Architecture. In: Proceeding of Graphics hardware, pp. 73–80 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, BU., Park, WC., Yang, SB., Han, TD. (2004). A Cost-Effective Supersampling for Full Scene AntiAliasing. In: Yew, PC., Xue, J. (eds) Advances in Computer Systems Architecture. ACSAC 2004. Lecture Notes in Computer Science, vol 3189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30102-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30102-8_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23003-8

  • Online ISBN: 978-3-540-30102-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics