Graphics Gems III (IBM Version)

Mathematical Notation. Pseudo-Code. Image Processing: Introduction. T. Moller, Fast Bitmap Stretching. D. Schumacher, General Filtered Image Rescaling. D. Schumacher, Optimization of Bitmap Scaling Operations. D. Bragg, A Simple Color Reduction Filter. D. Moore and J. Warren, Compact Isocontours from Sampled Data. T. Feldman, Generating Iso-Value Contours from a Pixmap. D. Salesin and R. Barzel, Compositing Black and White Bitmaps. C. Scofield, 2 1/2-D Depth of Field Simulation for Computer Animation. E. Furman, A Fast Boundary Generator for Composited Regions. Numerical and Programming Techniques: Introduction. S. Hill, IEEE Fast Square Root. S. Hill, A Simple Fast Memory Allocator. A.J. Hanson, The Rolling Ball. J. Rokne, Interval Arithmetic. A. Paeth, Fast Generation of Cyclic Sequences. A. Paeth, A Generic Pixel Selection Mechanism. P. Shirley, Nonuniform Random PointSets. R.N. Goldman, Cross Product in 4-Dimensions and Beyond. D. Badouel and C.A. Wuthrich, Face Connected Line Segment Generation in an N-Dimensional Space. Modeling and Transformations: Introduction. J. Morrison, Quaternion Interpolation with Extra Spins. R.N. Goldman, Decomposing Projective Transformations. R.N. Goldman, Decomposing Linear and Affine Transformations. J. Arvo, Fast Random Rotation Matrices. P. Dana, Issues and Techniques for Keyframing Transformations. K. Shoemake, Uniform Random Rotations. G. Elber, Interpolation Using Bezier Curves. A.H. Barr, Physically Based Superquadrics. 2D Geometry and Algorithms: Introduction. J. VanAken and R. Simar, A Parametric Elliptical Arc Algorithm. C. Rosati, A Simple Connection Algorithm for 2D Drawing. R.V. Srinivasan, A Fast Circle Clipping Algorithm. C.A. Shaffer and C.D. Feustel, Exact Computation of 2D Intersection. R. Miller, Joining Two Lines with a Circular Arc Fillet. F. Antonio, Faster Line Segment Intersection. C.A. Sevici, Solving the Problem of Appolonius and Other Related Problems. 3D Geometry and Algorithms: Introduction. F.J. Lopez-Lopez, Triangles Revisited. N. Chin, Partitioning a 3D Polygon with an Arbitrary Plane. P. Georgiades, Signed Distance from Point to Plane. D. Salesin and F. Tampieri, Grouping Nearly Coplanar Polygons into Coplanar Sets. F. Tampieri, Newell's Method for Computing the Plane Equation of a Polygon. P. Georgiades, Plane to Plane Intersection. D. Voorhies, Triangle-Cube Intersection. L. Wanger and M. Fusco, Fast N-Dimensional Extent Overlap Testing. D. Moore, Subdividing Simplices. D. Moore, Understanding Simploids. D. Lischinski, Converting Bezier Triangles into Rectangular Patches. T. Lindgren, J. Sanchez, J. Hall, and T. Gross, Curve Tesselation Criteria through Sampling. Ray Tracing and Radiosity: Introduction. K. Sung, Ray Tracing with BSP Tree. J.M. Cychosz and W.G. Waggenspack, Intersecting a Ray with a Quadric Surface. J.M. Cychosz, Use of Residency Masks and Object Space Partitioning to Eliminate Ray-Object Intersection Calculations. F.K.Musgrave, A Panoramic Virtual Screen for Ray Tracing. B. Trumbore, Rectangular Bounding Volumes for Popular Primitives. X. Wu, A Linear Time Simple Bounding Volume Algorithm. C. Wang, Physically Correct Direct Lighting for Distribution Ray Tracing. B. Bian, Hemisphere Projection of a Triangle. N.L. Max and M.J. Allison, Linear Radiosity Approximations Using Vertex-to-Vertex Form Factors. J.C. Beran-Koehn and M.J. Pavicic, Delta Form Factor Calculation for the Cubic Tetrahedral Algorithm. F. Tampieri, Accurate Form Factor Computation. Rendering: Introduction. A. Woo, The Shadow Depth Map Revisited. R.C.H. Cheng, Fast Linear Color Rendering. R.C.H. Cheng, Edge and Bitmask Calculations forAnti-Aliasing. T. Grace, Fast Span Conversion: Unrolling Short Loops. S. Hollasch, Progressive Image Refinement Via Gridded Sampling. K. Fleischer and D. Salesin, Accurate Polygon Scan Conversion Using Half-Open Intervals. A.S. Glassner, Darklights. A.S. Glassner, Anti-Aliasing in Triangular Pixels. J. Snyder, R. Barzel, and S.