[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

A hidden-surface algorithm with anti-aliasing

Published: 23 August 1978 Publication History

Abstract

In recent years we have gained understanding about aliasing in computer generated pictures and about methods for reducing the symptoms of aliasing. The chief symptoms are staircasing along edges and objects that pop on and off in time. The method for reducing these symptoms is to filter the image before sampling at the display resolution. One filter that is easy to understand and that works quite effectively is equivalent to integrating the visible intensities over the area that the pixel covers. There have been several implementations of this method - mostly unpublished - however most algorithms break down when the data for the pixel is complicated. Unfortunately, as the quality of displays and the complexity of pictures increase, the small errors that can occur in a single pixel become quite noticeable. A correct solution for this filter requires a hidden-surface algorithm at each pixel! If the data at the pixel is presented as a depth-ordered list of polygons then the average visible intensity can be found using a polygon clipper in a way similar to that employed by two known hidden-surface algorithms. All of the polygons in a pixel are clipped against some front unclipped edge into two lists of polygons. The algorithm is recursively entered with each new list and halts when the front polygon is clipped on all sides, thereby obscuring the polygons behind. The area weighted colors are then returned as the value to be added to the other pieces in the pixel.

References

[1]
Catmull, Edwin, A subdivision algorithm for computer display of curved surfaces, Technical report UTEC-CSs-74-133 University of Utah, 1974
[2]
Crow, Frank, The aliasing problem in Computer-generated shaded images, CACM November 1977
[3]
Myers, Allan J., An efficient visible surface program, Ohio State University, Computer Graphics Research Group, report to NSF, July 1975
[4]
Shoup, R.G., Some quantization effects in digitally-generated pictures, Society for Information Display, 1973 proceedings.
[5]
Sutherland, I.E., Polygon sorting by subdivision: A solution to the hidden-surface problem, Unpublished manuscript, October 1973, Also public lecture at University of Utah 1973.
[6]
Sutherland, I.E., and Hodgman, G.W., Reentrant polygon clipping, CACM January 1974.
[7]
Sutherland, I.E., Sproull, R.F., and Schumacker, R.A., A characterization of ten hidden-surface algorithms, ACM Computing Surveys, March 1974.
[8]
Hamlin, Griffith Jr., and Gear, C.W., Rasterscan hidden surface algorithm techniques, Siggraph 1977 proceedings.
[9]
Weiler, K. and Atherton, P., Hidden surface removal using polygon area sorting, Siggraph 1977 proceedings.

Cited By

View all
  • (2024)Efficient and Robust From-Point VisibilityIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.329113830:8(5313-5327)Online publication date: 1-Aug-2024
  • (2022)Merging plot of massive earthquake catalogs using the minimum number of active recordsEarth Science Informatics10.1007/s12145-022-00793-915:2(1355-1361)Online publication date: 26-Mar-2022
  • (2021)Vectorization for Fast, Analytic, and Differentiable VisibilityACM Transactions on Graphics10.1145/345209740:3(1-21)Online publication date: 15-Jul-2021
  • Show More Cited By

Index Terms

  1. A hidden-surface algorithm with anti-aliasing

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM SIGGRAPH Computer Graphics
      ACM SIGGRAPH Computer Graphics  Volume 12, Issue 3
      August 1978
      337 pages
      ISSN:0097-8930
      DOI:10.1145/965139
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGGRAPH '78: Proceedings of the 5th annual conference on Computer graphics and interactive techniques
        August 1978
        363 pages
        ISBN:9781450379083
        DOI:10.1145/800248
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 23 August 1978
      Published in SIGGRAPH Volume 12, Issue 3

      Check for updates

      Author Tags

      1. Aliasing
      2. Clipping
      3. Computer graphics
      4. Filtering
      5. Hidden-surface removal
      6. Sampling

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)317
      • Downloads (Last 6 weeks)41
      Reflects downloads up to 22 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Efficient and Robust From-Point VisibilityIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.329113830:8(5313-5327)Online publication date: 1-Aug-2024
      • (2022)Merging plot of massive earthquake catalogs using the minimum number of active recordsEarth Science Informatics10.1007/s12145-022-00793-915:2(1355-1361)Online publication date: 26-Mar-2022
      • (2021)Vectorization for Fast, Analytic, and Differentiable VisibilityACM Transactions on Graphics10.1145/345209740:3(1-21)Online publication date: 15-Jul-2021
      • (2020)Differentiable vector graphics rasterization for editing and learningACM Transactions on Graphics10.1145/3414685.341787139:6(1-15)Online publication date: 27-Nov-2020
      • (2020)Learning to manipulate amorphous materialsACM Transactions on Graphics10.1145/3414685.341786839:6(1-11)Online publication date: 27-Nov-2020
      • (2020)WeavecraftACM Transactions on Graphics10.1145/3414685.341786539:6(1-16)Online publication date: 27-Nov-2020
      • (2020)A novel discretization and numerical solver for non-fourier diffusionACM Transactions on Graphics10.1145/3414685.341786339:6(1-14)Online publication date: 27-Nov-2020
      • (2020)Modular primitives for high-performance differentiable renderingACM Transactions on Graphics10.1145/3414685.341786139:6(1-14)Online publication date: 27-Nov-2020
      • (2020)Simulation, modeling and authoring of glaciersACM Transactions on Graphics10.1145/3414685.341785539:6(1-14)Online publication date: 27-Nov-2020
      • (2020)To cut or to fillACM Transactions on Graphics10.1145/3414685.341785439:6(1-18)Online publication date: 27-Nov-2020
      • Show More Cited By

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media