1994 · 42 citations · 22 references
ComputingComputer ScienceComputer GraphicsComputer VisionRenderingGeometry ProcessingImage-based RenderingRendering PipelineVisibility ComputationAntialiasingHierarchical Z-bufferOctree DecompositionQuadtree DecompositionSubdivisionZ-buffer Algorithms
In previous work, we presented an algorithm to accelerate z-buffer rendering of enormously complex scenes. Here, we extend the approach to antialiased rendering with an algorithm that guarantees that each pixel of the output image is within a user-specified error tolerance of the filtered underlying continuous image. As before, we use an object-space octree to cull hidden geometry rapidly. However, instead of using an image-space depth pyramid to test visibility of collections of pixel samples, we use a quadtree data structure to test visibility throughout image-space regions. When regions are too complex, we use quadtree subdivision to simplify the geometry as in Warnock's algorithm. Subdivison stops when the algorithm can either analytically filter the required region or bound the convolution integral appropriately with interval methods. To the best of our knowledge, this is the first algorithm to antialias with guaranteed accuracy scenes consisting of hundreds of millions of polygons.
22
Computer graphics: principles and practice
Choice Reviews Online · 2013 · 4.7K citations
Summed-area tables for texture mapping
Franklin C. Crow · 1984 · 1.1K citations
Robert L. Cook, Thomas Porter, Loren Carpenter · 1984 · 855 citations · Full text
Lance R. Williams · 1983 · 721 citations · Full text
Hierarchical Z-buffer visibility
Ned Greene, Michael Kass, Gavin Miller · 1993 · 499 citations