Planar 2-pass texture mapping and warping
- 1 August 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 21 (4), 263-272
- https://doi.org/10.1145/37402.37433
Abstract
The 2-pass tranformation replaces a 2-D (2-dimensional) transformation with a sequence of orthogonal, simpler 1-D transformation. It may be used for the closely related processes of texture mapping and warping in computer graphics and image processing. First, texture maps onto planar quadric and superquadric surfaces and, second, planar bicubic and biquadratic warps of images are shown to be 2-pass transformable. A distinction between serial and parallel warps is introduced to solve a confusion in terms between computer graphics and image processing. It is shown that an n -th order serial polynomial warp is equivalent to an ( n 2 + n )-th order parallel polynomial warp. It is also shown that the serial equivalent to a parallel polynomial warp is generally not a polynomial warp, being more complicated than a polynomial. The unusual problem of bottlenecking and the usual one of antialiasing are discussed in the 2-pass context.Keywords
This publication has 3 references indexed in Scilit:
- A Nonaliasing, Real-Time Spatial Transform TechniqueIEEE Computer Graphics and Applications, 1986
- Superquadrics and Angle-Preserving TransformationsIEEE Computer Graphics and Applications, 1981
- 3-D transformations of images in scanline orderPublished by Association for Computing Machinery (ACM) ,1980