Graphics Gems 3

Content: 
Inside Front Cover, Page ii
Front Matter, Page iii
Copyright, Page iv
About the Cover, Pages v-vi
FOREWORD, Pages xvii-xviii
PREFACE, Pages xix-xx
MATHEMATICAL NOTATION, Pages xxi-xxii
PSEUDO-CODE, Pages xxiii-xxvii
CONTRIBUTORS, Pages xxviii-xxxi
INTRODUCTION TO IMAGE PROCESSING, Page 3
I.1 - FAST BITMAP STRETCHING, Pages 4-7
I.2 - GENERAL FILTERED IMAGE RESCALING, Pages 8-16
I.3 - OPTIMIZATION OF BITMAP SCALING OPERATIONS, Pages 17-19
I.4 - A SIMPLE COLOR REDUCTION FILTER, Pages 20-22
I.5 - COMPACT ISOCONTOURS FROM SAMPLED DATA, Pages 23-28
I.6 - GENERATING ISOVALUE CONTOURS FROM A PIXMAP, Pages 29-33
I.7 - COMPOSITING BLACK-AND-WHITE BITMAPS, Pages 34-35
I.8 - 2½-DEPTH-OF-FIELD SIMULATION FOR COMPUTER ANIMATION, Pages 36-38
I.9 - A FAST BOUNDARY GENERATOR FOR COMPOSITED REGIONS, Pages 39-43
INTRODUCTION TO NUMERICAL AND PROGRAMMING TECHNIQUES, Page 47
II.1 - IEEE FAST SQUARE ROOT, Page 48
II.2 - A SIMPLE FAST MEMORY ALLOCATOR, Pages 49-50
II.3 - THE ROLLING BALL, Pages 51-60
II.4 - INTERVAL ARITHMETIC, Pages 61-66
II.5 - FAST GENERATION OF CYCLIC SEQUENCES, Pages 67-76
II.6 - A GENERIC PIXEL SELECTION MECHANISM, Pages 77-79
II.7 - NONUNIFORM RANDOM POINT SETS VIA WARPING, Pages 80-83
II.8 - CROSS PRODUCT IN FOUR DIMENSIONS AND BEYOND, Pages 84-88
II.9 - FACE-CONNECTED LINE SEGMENT GENERATION IN AN n-DIMENSIONAL SPACE, Pages 89-91
INTRODUCTION TO MODELING AND TRANSFORMATIONS, Page 95
III.1 - QUATERNION INTERPOLATION WITH EXTRA SPINS, Pages 96-97
III.2 - DECOMPOSING PROJECTIVE TRANSFORMATIONS, Pages 98-107
III.3 - DECOMPOSING LINEAR AND AFFINE TRANSFORMATIONS, Pages 108-116
III.4 - FAST RANDOM ROTATION MATRICES, Pages 117-120
III.5 - ISSUES AND TECHNIQUES FOR KEYFRAMING TRANSFORMATIONS, Pages 121-123
III.6 - UNIFORM RANDOM ROTATIONS, Pages 124-132
III.7 - INTERPOLATION USING BÉZIER CURVES, Pages 133-136
III.8 - RIGID PHYSICALLY BASED SUPERQUADRICS, Pages 137-159
INTRODUCTION TO 2-D GEOMETRY AND ALGORITHMS, Page 163
IV.1 - A PARAMETRIC ELLIPTICAL ARC ALGORITHM, Pages 164-172
IV.2 - SIMPLE CONNECTION ALGORITHM FOR 2-D DRAWING, Pages 173-181
IV.3 - A FAST CIRCLE CLIPPING ALGORITHM, Pages 182-187
IV.4 - EXACT COMPUTATION OF 2-D INTERSECTIONS, Pages 188-192
IV.5 - JOINING TWO LINES WITH A CIRCULAR ARC FILLET, Pages 193-198
IV.6 - FASTER LINE SEGMENT INTERSECTION, Pages 199-202
IV.7 - SOLVING THE PROBLEM OF APOLLONIUS AND OTHER RELATED PROBLEMS, Pages 203-209
INTRODUCTION TO 3-D GEOMETRY AND ALGORITHMS, Pages 213-214
V.1 - TRIANGLES REVISITED, Pages 215-218
V.2 - PARTITIONING A 3-D CONVEX POLYGON WITH AN ARBITRARY PLANE, Pages 219-222
V.3 - SIGNED DISTANCE FROM POINT TO PLANE, Pages 223-224
V.4 - GROUPING NEARLY COPLANAR POLYGONS INTO COPLANAR SETS, Pages 225-230
V.5 - NEWELL'S METHOD FOR COMPUTING THE PLANE EQUATION OF A POLYGON, Pages 231-232
V.6 - PLANE-TO-PLANE INTERSECTION, Pages 233-235
V.7 - TRIANGLE-CUBE INTERSECTION, Pages 236-239
V.8 - FAST n-DIMENSIONAL EXTENT OVERLAP TESTING, Pages 240-243
V.9 - SUBDIVIDING SIMPLICES, Pages 244-249
V.10 - UNDERSTANDING SIMPLOIDS, Pages 250-255
V.11 - CONVERTING BÉZIER TRIANGLES INTO RECTANGULAR PATCHES, Pages 256-261
V.12 - CURVE TESSELLATION CRITERIA THROUGH SAMPLING, Pages 262-265
INTRODUCTION TO RAY TRACING AND RADIOSITY, Pages 269-270
VI.1 - RAY TRACING WITH THE BSP TREE, Pages 271-274
VI.2 - INTERSECTING A RAY WITH A QUADRIC SURFACE, Pages 275-283
VI.3 - USE OF RESIDENCY MASKS AND OBJECT SPACE PARTITIONING TO ELIMINATE RAY-OBJECT INTERSECTION CALCULATIONS, Pages 284-287
VI.4 - A PANORAMIC VIRTUAL SCREEN FOR RAY TRACING, Pages 288-294
VI.5 - RECTANGULAR BOUNDING VOLUMES FOR POPULAR PRIMITIVES, Pages 295-300
VI.6 - A LINEAR-TIME SIMPLE BOUNDING VOLUME ALGORITHM, Pages 301-306
VI.7 - PHYSICALLY CORRECT DIRECT LIGHTING FOR DISTRIBUTION RAY TRACING, Pages 307-312,312a,312b,312c,312d,313
VI.8 - HEMISPHERICAL PROJECTION OF A TRIANGLE, Pages 314-317
VI.9 - LINEAR RADIOSITY APPROXIMATION USING VERTEX-TO-VERTEX FORM FACTORS, Pages 318-323
VI.10 - DELTA FORM-FACTOR CALCULATION FOR THE CUBIC TETRAHEDRAL ALGORITHM, Pages 324-328
VI.11 - ACCURATE FORM-FACTOR COMPUTATION, Pages 329-333
INTRODUCTION TO RENDERING, Page 337
VII.1 - THE SHADOW DEPTH MAP REVISITED, Pages 338-342
VII.2 - FAST LINEAR COLOR RENDERING, Pages 343-348
VII.3 - EDGE AND BIT-MASK CALCULATIONS FOR ANTI-ALIASING, Pages 349-354
VII.4 - FAST SPAN CONVERSION: UNROLLING SHORT LOOPS, Pages 355-357
VII.5 - PROGRESSIVE IMAGE REFINEMENT VIA GRIDDED SAMPLING, Pages 358-361
VII.6 - ACCURATE POLYGON SCAN CONVERSION USING HALF-OPEN INTERVALS, Pages 362-365
VII.7 - DARKLIGHTS, Pages 366-368
VII.8 - ANT-ALIASING IN TRIANGULAR PIXELS, Pages 369-373
VII.9 - MOTION BLUR ON GRAPHICS WORKSTATIONS, Pages 374-382
VII.10 - THE SHADER CACHE: A RENDERING PIPELINE ACCELERATOR, Pages 383-389
GRAPHICS GEMS C HEADER FILE, Pages 393-395
2-D AND 3-D VECTOR C LIBRARY: Corrected and Indexed, Pages 396-404
USEFUL C MACROS FOR VECTOR OPERATIONS, Pages 405-407
FAST BITMAP STRETCHING: (page 4), Pages 411-413
GENERAL FILTERED IMAGE RESCALING: (page 8), Pages 414-424
OPTIMIZATION OF BITMAP SCALING OPERATIONS: (page 17), Pages 425-428
A SIMPLE COLOR REDUCTION FILTER: (page 20), Pages 429-431
GENERATING ISOVALUE CONTOURS FROM A PIXMAP: (page 29), Pages 432-440
A FAST BOUNDARY GENERATOR FOR COMPOSITED REGIONS: (page 39), Pages 441-445
IEEE FAST SQUARE ROOT: (page 48), Pages 446-447
A SIMPLE FAST MEMORY ALLOCATOR: (page 49), Pages 448-451
THE ROLLING BALL: (page 51), Pages 452-453
INTERVAL ARITHMETIC: (page 61), Pages 454-457
FAST GENERATION OF CYCLIC SEQUENCES: (page 67), Pages 458-459
FACE-CONNECTED LINE SEGMENT GENERATION IN AN n-DIMENSIONAL SPACE: (page 89), Page 460
QUATERNION INTERPOLATION WITH EXTRA SPINS: (page 96), Pages 461-462
FAST RANDOM ROTATION MATRICES: (page 117), Pages 463-464
UNIFORM RANDOM ROTATIONS: (page 124), Pages 465-467
INTERPOLATION USING BÉZIER CURVES: (page 133), Pages 468-471
PHYSICALLY BASED SUPERQUADRICS: (page 137), Pages 472-477
A PARAMETRIC ELLIPTICAL ARC ALGORITHM: (page 164), Pages 478-479
SIMPLE CONNECTION ALGORITHM FOR 2-D DRAWING: (page 173), Pages 480-486
A FAST CIRCLE CLIPPING ALGORITHM: (page 182), Pages 487-490
EXACT COMPUTATION OF 2-D INTERSECTIONS: (page 188), Pages 491-495
JOINING TWO LINES WITH A CIRCULAR ARC FILLET: (page 193), Pages 496-499
FASTER LINE SEGMENT INTERSECTION: (page 199), Pages 500-501
PARTITIONING A 3-D CONVEX POLYGON WITH AN ARBITRARY PLANE: (page 219), Pages 502-510
SIGNED DISTANCE FROM POINT TO PLANE: (page 223), Page 511
GROUPING NEARLY COPLANAR POLYGONS INTO COPLANAR SETS: (page 225), Pages 512-516
NEWELL'S METHOD FOR COMPUTING THE PLANE EQUATION OF A POLYGON: (page 231), Pages 517-518
PLANE-TO-PLANE INTERSECTION: (page 233), Pages 519-520
TRIANGLE–CUBE INTERSECTION: (page 236), Pages 521-526
FAST n-DIMENSIONAL EXTENT OVERLAP TESTING: (page 240), Pages 527-533
SUBDIVIDING SIMPLICES: (page 244), Pages 534-535
CONVERTING BÉZIER TRIANGLES INTO RECTANGULAR PATCHES: (page 256), Pages 536-537
RAY TRACING WITH THE BSP TREE: (page 271), Pages 538-546
INTERSECTING A RAY WITH A QUADRIC SURFACE: (page 275), Pages 547-550
A PANORAMIC VIRTUAL SCREEN FOR RAY TRACING: (page 288), Pages 551-554
RECTANGULAR BOUNDING VOLUMES FOR POPULAR PRIMITIVES: (page 295), Pages 555-561
PHYSICALLY CORRECT DIRECT LIGHTING FOR DISTRIBUTION RAY TRACING: (page 307), Pages 562-568
HEMISPHERICAL PROJECTION OF A TRIANGLE: (page 314), Pages 569-574
DELTA FORM-FACTOR CALCULATION FOR THE CUBIC TETRAHEDRAL ALGORITHM: (page 324), Pages 575-576
ACCURATE FORM-FACTOR COMPUTATION: (page 329), Pages 577-581
THE SHADOW DEPTH MAP REVISITED: (page 338), Page 582
FAST LINEAR COLOR RENDERING: (page 343), Pages 583-585
EDGE AND BIT-MASK CALCULATIONS FOR ANTI-ALIASING: (page 349), Pages 586-593
FAST SPAN CONVERSION: UNROLLING SHORT LOOPS: (page 355), Pages 594-596
PROGRESSIVE IMAGE REFINEMENT VIA GRIDDED SAMPLING: (page 358), Pages 597-598
ACCURATE POLYGON SCAN CONVERSION USING HALF-OPEN INTERVALS: (page 362), Pages 599-605
MOTION BLUR ON GRAPHICS WORKSTATIONS: (page 374), Pages 606-609
REFERENCES, Pages 611-623
INDEX, Pages 625-631