John M. Airey
Microsoft
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by John M. Airey.
international conference on computer graphics and interactive techniques | 2000
Mark S. Peercy; Marc Olano; John M. Airey; P. Jeffrey Ungar
Programmable shading is a common technique for production animation, but interactive programmable shading is not yet widely available. We support interactive programmable shading on virtually any 3D graphics hardware using a scene graph library on top of OpenGL. We treat the OpenGL architecture as a general SIMD computer, and translate the high-level shading description into OpenGL rendering passes. While our system uses OpenGL, the techniques described are applicable to any retained mode interface with appropriate extension mechanisms and hardware API with provisions for recirculating data through the graphics pipeline. We present two demonstrations of the method. The first is a constrained shading language that runs on graphics hardware supporting OpenGL 1.2 with a subset of the ARB imaging extensions. We remove the shading language constraints by minimally extending OpenGL. The key extensions are color range (supporting extended range and precision data types) and pixel texture (using framebuffer values as indices into texture maps). Our second demonstration is a renderer supporting the RenderMan Interface and RenderMan Shading Language on a software implementation of this extended OpenGL. For both languages, our compiler technology can take advantage of extensions and performance characteristics unique to any particular graphics hardware.
international conference on computer graphics and interactive techniques | 1997
Mark S. Peercy; John M. Airey; Brian Cabral
We present a bump mapping method that requires minimal hardware beyond that necessary for Phong shading. We eliminate the costly per-pixel steps of reconstructing a tangent space and perturbing the interpolated normal vector by a) interpolating vectors that have been transformed into tangent space at polygon vertices and b) storing a precomputed, perturbed normal map as a texture. This represents a considerable savings in hardware or rendering speed compared to a straightforward implementation of bump mapping. CR categories and subject descriptors: I.3.3 [Computer Graphics]: Picture/Image generation; I.3.7 [Image Processing]: Enhancement
Archive | 1997
Mark S. Peercy; John M. Airey; Brian Cabral
Archive | 1997
Brian Cabral; Mark S. Peercy; John M. Airey
Archive | 1998
Mark S. Peercy; John M. Airey; Jonathan Brandt
Archive | 2012
John M. Airey; Mark S. Peercy; Robert A. Drebin; John Montrym; David L. Dignam; Christopher J. Migdal; Danny D. Loh
Archive | 2000
Mark S. Peercy; Thomas M. Olano; John M. Airey
Archive | 2000
Mark S. Peercy; John M. Airey; Andrew D. Bowen
Archive | 2012
John M. Airey; Mark S. Peercy; Robert A. Drebin; John Montrym; David L. Dignam; Christopher J. Migdal; Danny D. Loh
Archive | 2012
John M. Airey; Mark S. Peercy; Robert A. Drebin; John Montrym; David L. Dignam; Christopher J. Migdal; Danny D. Loh