ABSTRACT
Texture-map computations can be made tractable through use of precalculated tables which allow computational costs independent of the texture density. The first example of this technique, the “mip” map, uses a set of tables containing successively lower-resolution representations filtered down from the discrete texture function. An alternative method using a single table of values representing the integral over the texture function rather than the function itself may yield superior results at similar cost. The necessary algorithms to support the new technique are explained. Finally, the cost and performance of the new technique is compared to previous techniques.
- 1.Blinn. J. and Newell. M., "Texture and Reflection on Computer Generated Images", Communications of the ACM, Vol. 19, #10, Oct. 1976. Google ScholarDigital Library
- 2.Blinn. J., "Computer Display of Curved Surfaces", PhD. Dissertation, Department of Computer Science, University of Utah. December 1978. Google ScholarDigital Library
- 3.Catmull, E,. "A Subdivision Algorithm for Computer Display of Curved Surfaces", PhD. Dissertation, Department of Computer Science, University of Utah, Tech. Report UTEC-CSc-74-133, December 1974. Google ScholarDigital Library
- 4.4. Catmull. E. and Smith A. R., "3-D Transformation of Images in Scanline Order", Computer Graphics (Proc. Siggraph '80), Vol. 14. July 1980. Google ScholarDigital Library
- 5.Feibush, E. A., Levoy, M., and Cook, R. L., "Synthetic Texturing Using Digital Filters", Computer Graphics (Proc. Siggraph '80), Vol. 14, July 1980. Google ScholarDigital Library
- 6.Fournier, A., Fussell, D., and Carpenter, L., "Computer Rendering of Stochastic Models", Communications of the ACM, Vol. 25, #6, June 1982. Google ScholarDigital Library
- 7.Hackathorn. R. and Parent. R., Private Communication, 1980.Google Scholar
- 8.Haruyama, S, and Barsky, B. A., "Using Stochastic Modeling for Texture Generation", IEEE Computer Graphics and Applications, Vol. 4, # 3, March 1984.Google ScholarDigital Library
- 9.Norton, A., Rockwood, A. P., and Skomolski, P. S., "Clamping: A Method of Antialiasing Textured Surfaces by Bandwidth Limiting in Object Space", Computer Graphics (Proc. Siggraph '82), Vol. 16, #3, July 1982. Google ScholarDigital Library
- 10.Williams, L. "Pyramidal Parametrics", Computer Graphics, Vol. 17, #3, July 1983. Google ScholarDigital Library
Index Terms
- Summed-area tables for texture mapping
Recommendations
Relief texture mapping
SIGGRAPH '00: Proceedings of the 27th annual conference on Computer graphics and interactive techniquesWe present an extension to texture mapping that supports the representation of 3-D surface details and view motion parallax. The results are correct for viewpoints that are static or moving, far away or nearby. Our approach is very simple: a relief ...
Summed-area tables for texture mapping
Texture-map computations can be made tractable through use of precalculated tables which allow computational costs independent of the texture density. The first example of this technique, the “mip” map, uses a set of tables containing successively lower-...
Surface splatting
SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniquesModern laser range and optical scanners need rendering techniques that can handle millions of points with high resolution textures. This paper describes a point rendering and texture filtering technique called surface splatting which directly renders ...
Comments