-
Notifications
You must be signed in to change notification settings - Fork 265
/
gems.html
1125 lines (1125 loc) · 42.7 KB
/
gems.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<html>
<head>
<title>Graphics Gems, by Book</title>
</head>
<body>
<H1>Graphics Gems, by Book</H1>
Listed by book, in order.
<UL>
<LI><a href="#gems">Graphics Gems</a>
<LI><a href="#gemsii">Graphics Gems II</a>
<LI><a href="#gemsiii">Graphics Gems III</a>
<LI><a href="#gemsiv">Graphics Gems IV</a>
<LI><a href="#gemsv">Graphics Gems V</a>
</UL>
<P>
<I><a href="index.html">return to main page</a></I>
<HR>
<P><H2><a name="gems">Graphics Gems</a></H2>Glassner, Andrew,
<B>Useful 2D Geometry</B>,
p. 3-11.<BR>
Glassner, Andrew,
<B>Useful Trigonometry</B>,
p. 13-17.<BR>
Paeth, Alan W.,
<B>Trigonometric Functions at Select Points</B>,
p. 18-19.<BR>
Goldman, Ronald,
<B>Triangles</B>,
p. 20-23.<BR>
Turk, Greg,
<B>Generating Random Points in Triangles</B>,
p. 24-28, code: p. 649-650, <a href="gems/TriPoints.c">TriPoints.c</a>.<BR>
Shapira, Andrew,
<B>Fast Line-Edge Intersections on a Uniform Grid</B>,
p. 29-36, code: p. 651-653, <a href="gems/LineEdge.c">LineEdge.c</a>.<BR>
Thompson, Kelvin,
<B>Area of Intersection: Circle and a Half-Plane</B>,
p. 38-39.<BR>
Thompson, Kelvin,
<B>Area of Intersection: Circle and a Thick Line</B>,
p. 40-42.<BR>
Thompson, Kelvin,
<B>Area of Intersection: Two Circles</B>,
p. 43-46.<BR>
Thompson, Kelvin,
<B>Vertical Distance from a Point to a Line</B>,
p. 47-48.<BR>
Paeth, Alan W.,
<B>A Fast 2D Point-on-line Test</B>,
p. 49-50, code: p. 654-655, <a href="gems/PntOnLine.c">PntOnLine.c</a>.<BR>
Shaffer, Clifford A.,
<B>Fast Circle-Rectangle Intersection Checking</B>,
p. 51-53, code: p. 656, <a href="gems/CircleRect.c">CircleRect.c</a>.<BR>
Paeth, Alan W.,
<B>Circles of Integral Radius on Integer Lattices</B>,
p. 57-60.<BR>
Heckbert, Paul S.,
<B>Nice Numbers for Graph Labels</B>,
p. 61-63, code: p. 657-659, <a href="gems/Label.c">Label.c</a>.<BR>
Cychosz, Joseph M.,
<B>Efficient Generation of Sampling Jitter Using Look-up Tables</B>,
p. 64-74, code: p. 660-661, <a href="gems/FastJitter.c">FastJitter.c</a>.<BR>
Morrison, Jack C.,
<B>Fast Anti-Aliasing Polygon Scan Conversion</B>,
p. 76-83, code: p. 662-666, <a href="gems/AAPolyScan.c">AAPolyScan.c</a>.<BR>
Heckbert, Paul S.,
<B>Generic Convex Polygon Scan Conversion and Clipping</B>,
p. 84-86, code: p. 667-680, <a href="gems/PolyScan/">PolyScan/</a>.<BR>
Heckbert, Paul S.,
<B>Concave Polygon Scan Conversion</B>,
p. 87-91, code: p. 681-684, <a href="gems/ConcaveScan.c">ConcaveScan.c</a>.<BR>
Wallis, Bob,
<B>Fast Scan Conversion of Arbitrary Polygons</B>,
p. 92-97.<BR>
Heckbert, Paul S.,
<B>Digital Line Drawing</B>,
p. 99-100, code: p. 685, <a href="gems/DigitalLine.c">DigitalLine.c</a>.<BR>
Wyvill, Brian,
<B>Symmetric Double Step Line Algorithm</B>,
p. 101-104, code: p. 686-689, <a href="gems/DoubleLine.c">DoubleLine.c</a>.<BR>
Thompson, Kelvin,
<B>Rendering Anti-Aliased Lines</B>,
p. 105-106, code: p. 690-693, <a href="gems/AALines/">AALines/</a>.<BR>
Ritter, Jack,
<B>An Algorithm for Filling in 2D Wide Line Bevel Joints</B>,
p. 107-113.<BR>
Wallis, Bob,
<B>Rendering Fat Lines on a Raster Grid</B>,
p. 114-120.<BR>
Spoelder, Hans J.W., and Ullings, Fons H.,
<B>Two-Dimensional Clipping: A Vector-Based Approach</B>,
p. 121-128, code: p. 694-710, <a href="gems/2DClip/">2DClip/</a>.<BR>
Lee, Greg, Penk, Mike, and Wallis, Bob,
<B>Periodic Tilings of the Plane on a Raster Grid</B>,
p. 129-139.<BR>
Pavicic, Mark J.,
<B>Anti-Aliasing Filters that Minimize "Bumpy" Sampling</B>,
p. 144-146.<BR>
Turkowski, Ken,
<B>Filters for Common Resampling Tasks</B>,
p. 147-165.<BR>
Olsen, John,
<B>Smoothing Enlarged Monochrome Images</B>,
p. 166-170.<BR>
Paeth, Alan W.,
<B>Median Finding on a 3-by-3 Grid</B>,
p. 171-175, code: p. 711-712, <a href="gems/Median.c">Median.c</a>.<BR>
Hawley, Stephen,
<B>Ordered Dithering</B>,
p. 176-178, code: p. 713-714, <a href="gems/OrderDither.c">OrderDither.c</a>.<BR>
Paeth, Alan W.,
<B>A Fast Algorithm for General Raster Rotation</B>,
p. 179-195.<BR>
Schumacher, Dale A.,
<B>Useful 1-to-1 Pixel Transforms</B>,
p. 196-209.<BR>
Thompson, Kelvin,
<B>Alpha Blending</B>,
p. 210-211.<BR>
Glassner, Andrew,
<B>Frame Buffers and Color Maps</B>,
p. 215-218.<BR>
Paeth, Alan W.,
<B>Reading a Write-Only Write Mask</B>,
p. 219-220.<BR>
Morton, Mike,
<B>A Digital "Dissolve" Effect</B>,
p. 221-232, code: p. 715-717, <a href="gems/Dissolve.c">Dissolve.c</a>.<BR>
Paeth, Alan W.,
<B>Mapping RGB Triples Onto Four Bits</B>,
p. 233-245, code: p. 718, <a href="gems/RGBTo4Bits.c">RGBTo4Bits.c</a>.<BR>
Heckbert, Paul S.,
<B>What Are the Coordinates of a Pixel?</B>,
p. 246-248.<BR>
Paeth, Alan W.,
<B>Proper Treatment of Pixels as Integers</B>,
p. 249-256, code: p. 719, <a href="gems/PixelInteger.c">PixelInteger.c</a>.<BR>
Glassner, Andrew,
<B>Normal Coding</B>,
p. 257-264.<BR>
Heckbert, Paul S.,
<B>Recording Animation in Binary Order for Progressive Temporal Refinement</B>,
p. 265-269, code: p. 720, <a href="gems/BinRec.c">BinRec.c</a>.<BR>
Schumacher, Dale A.,
<B>1-to-1 Pixel Transforms Optimized Through Color-Map Manipulation</B>,
p. 270-274.<BR>
Heckbert, Paul S.,
<B>A Seed Fill Algorithm</B>,
p. 275-277, code: p. 721-722, <a href="gems/SeedFill.c">SeedFill.c</a>.<BR>
Fishkin, Ken,
<B>Filling a Region in a Frame Buffer</B>,
p. 278-284.<BR>
Wallace, Bill,
<B>Precalculating Addresses for Fast Fills, Circles, and Lines</B>,
p. 285-286.<BR>
Gervautz, Michael, and Purgathofer, Werner,
<B>A Simple Method for Color Quantization: Octree Quantization</B>,
p. 287-293.<BR>
Glassner, Andrew,
<B>Useful 3D Geometry</B>,
p. 297-300.<BR>
Ritter, Jack,
<B>An Efficient Bounding Sphere</B>,
p. 301-303, code: p. 723-725, <a href="gems/BoundSphere.c">BoundSphere.c</a>.<BR>
Goldman, Ronald,
<B>Intersection of Two Lines in Three-Space</B>,
p. 304.<BR>
Goldman, Ronald,
<B>Intersection of Three Planes</B>,
p. 305.<BR>
Paeth, Alan W.,
<B>Digital Cartography for Computer Graphics</B>,
p. 307-320.<BR>
Bame, Paul D.,
<B>Albers Equal-Area Conic Map Projection</B>,
p. 321-325, code: p. 726-729, <a href="gems/Albers.c">Albers.c</a>.<BR>
Montani, Claudio, and Scopigno, Roberto,
<B>Spheres-to-Voxels Conversion</B>,
p. 327-334.<BR>
Arvo, James,
<B>A Simple Method for Box-Sphere Intersection Testing</B>,
p. 335-339, code: p. 730-732, <a href="gems/BoxSphere.c">BoxSphere.c</a>.<BR>
Wyvill, Brian,
<B>3D Grid Hashing Function</B>,
p. 343-345, code: p. 733-734, <a href="gems/Hash3D.c">Hash3D.c</a>.<BR>
Hultquist, Jeff,
<B>Backface Culling</B>,
p. 346-347.<BR>
Lee, Mark E.,
<B>Fast Dot Products for Shading</B>,
p. 348-360.<BR>
Thompson, Kelvin,
<B>Scanline Depth Gradient of a Z-Buffered Triangle</B>,
p. 361-363.<BR>
Glassner, Andrew,
<B>Simulating Fog and Haze</B>,
p. 364-365.<BR>
Glassner, Andrew,
<B>Interpretation of Texture Map Indices</B>,
p. 366-375.<BR>
Glassner, Andrew,
<B>Multidimensional Sum Tables</B>,
p. 376-381.<BR>
Ritter, Jack,
<B>A Simple Ray Rejection Test</B>,
p. 385-386.<BR>
Hultquist, Jeff,
<B>Intersection of a Ray with a Sphere</B>,
p. 388-389.<BR>
Badouel, Didier,
<B>An Efficient Ray-Polygon Intersection</B>,
p. 390-393, code: p. 735, <a href="gems/RayPolygon.c">RayPolygon.c</a>.<BR>
Woo, Andrew,
<B>Fast Ray-Polygon Intersection</B>,
p. 394.<BR>
Woo, Andrew,
<B>Fast Ray-Box Intersection</B>,
p. 395-396, code: p. 736-737, <a href="gems/RayBox.c">RayBox.c</a>.<BR>
Pearce, Andrew,
<B>Shadow Attenuation for Ray Tracing Transparent Objects</B>,
p. 397-399.<BR>
Schwarze, Jochen,
<B>Cubic and Quartic Roots</B>,
p. 404-407, code: p. 738-786, <a href="gems/Roots3And4.c">Roots3And4.c</a>.<BR>
Schneider, Philip J.,
<B>A Bézier Curve-Based Root-Finder</B>,
p. 408-415, code: p. 787, <a href="gems/NearestPoint.c">NearestPoint.c</a>.<BR>
Hook, D.G., and McAree, P.R.,
<B>Using Sturm Sequences To Bracket Real Roots of Polynomial Equations</B>,
p. 416-423, code: p. 743-755, <a href="gems/Sturm/">Sturm/</a>.<BR>
Lalonde, Paul, and Dawson, Robert,
<B>A High-Speed, Low Precision Square Root</B>,
p. 424-426, code: p. 756-757, <a href="gems/SquareRoot.c">SquareRoot.c</a>.<BR>
Paeth, Alan W.,
<B>A Fast Approximation To the Hypotenuse</B>,
p. 427-431, code: p. 758, <a href="gems/HypotApprox.c">HypotApprox.c</a>.<BR>
Ritter, Jack,
<B>A Fast Approximation To 3D Euclidian Distance</B>,
p. 432-433.<BR>
Thompson, Kelvin,
<B>Full-Precision Constants</B>,
p. 434.<BR>
Thompson, Kelvin,
<B>Converting Between Bits and Digits</B>,
p. 435.<BR>
Wyvill, Brian,
<B>Storage-free Swapping</B>,
p. 436-437.<BR>
Glassner, Andrew,
<B>Generating Random Integers</B>,
p. 438-439.<BR>
Ritter, Jack,
<B>Fast 2D-3D Rotation</B>,
p. 440-441.<BR>
Shoemake, Ken,
<B>Bit Patterns for Encoding Angles</B>,
p. 442.<BR>
Shaffer, Clifford A.,
<B>Bit Interleaving for Quad- or Octrees</B>,
p. 443-447, code: p. 759-762, <a href="gems/Interleave.c">Interleave.c</a>.<BR>
Fishkin, Ken,
<B>A Fast HSL-to-RGB Transform</B>,
p. 448-449, code: p. 763-764, <a href="gems/HSLtoRGB.c">HSLtoRGB.c</a>.<BR>
Thompson, Kelvin,
<B>Matrix Identities</B>,
p. 453-454.<BR>
Thompson, Kelvin,
<B>Transforming Axes</B>,
p. 456-459.<BR>
Thompson, Kelvin,
<B>Fast Matrix Multiplication</B>,
p. 460-461.<BR>
Hultquist, Jeff,
<B>A Virtual Trackball</B>,
p. 462-463.<BR>
Raible, Eric,
<B>Matrix Orthogonalization</B>,
p. 464, code: p. 765, <a href="gems/MatrixOrtho.c">MatrixOrtho.c</a>.<BR>
Pique, Michael E.,
<B>Rotation Tools</B>,
p. 465-469.<BR>
Carling, Richard,
<B>Matrix Inversion</B>,
p. 470-471, code: p. 766-769, <a href="gems/MatrixInvert.c">MatrixInvert.c</a>.<BR>
Goldman, Ronald,
<B>Matrices and Transformations</B>,
p. 472-475.<BR>
Cychosz, Joseph M.,
<B>Efficient Post-Concatenation of Transformation Matrices</B>,
p. 476-481, code: p. 770-772, <a href="gems/MatrixPost.c">MatrixPost.c</a>.<BR>
Greene, Ned,
<B>Transformation Identities</B>,
p. 485-493.<BR>
Turkowski, Ken,
<B>Fixed-Point Trigonometry with CORDIC Iterations</B>,
p. 494-497, code: p. 773-774, <a href="gems/FixedTrig.c">FixedTrig.c</a>.<BR>
Maillot, Patrick-Gilles,
<B>Using Quaternions for Coding 3D Transformations</B>,
p. 498-515, code: p. 775-777, <a href="gems/Quaternions.c">Quaternions.c</a>.<BR>
Cunningham, Steve,
<B>3D Viewing and Rotation Using Orthonormal Bases</B>,
p. 516-521, code: p. 778-779, <a href="gems/ViewTrans.c">ViewTrans.c</a>.<BR>
Turkowski, Ken,
<B>The Use of Coordinate Frames in Computer Graphics</B>,
p. 522-532.<BR>
Wallis, Bob,
<B>Forms, Vectors, and Transforms</B>,
p. 533-538, code: p. 780-784, <a href="gems/Forms.c">Forms.c</a>.<BR>
Turkowski, Ken,
<B>Properties of Surface-Normal Transformations</B>,
p. 539-547.<BR>
Arvo, James,
<B>Transforming Axis-Aligned Bounding Boxes</B>,
p. 548-550, code: p. 785-786, <a href="gems/TransBox.c">TransBox.c</a>.<BR>
Hall, Mark,
<B>Defining Surfaces From Sampled Data</B>,
p. 552-557.<BR>
Hall, Mark,
<B>Defining Surfaces From Contour Data</B>,
p. 558-561.<BR>
Glassner, Andrew,
<B>Computing Surface Normals for 3D Models</B>,
p. 562-566.<BR>
Bloomenthal, Jules,
<B>Calculation of Reference Frames Along a Space Curve</B>,
p. 567-571.<BR>
Glassner, Andrew,
<B>Planar Cubic Curves</B>,
p. 575-578.<BR>
Rasala, Richard,
<B>Explicit Cubic Spline Interpolation Formulas</B>,
p. 579-584.<BR>
Gomez, Julian,
<B>Fast Spline Drawing</B>,
p. 585-586.<BR>
Goldman, Ronald,
<B>Some Properties of Bézier Curves</B>,
p. 587-593.<BR>
Wallis, Bob,
<B>Tutorial on Forward Differencing</B>,
p. 594-603.<BR>
Goldman, Ronald,
<B>Integration of Bernstein Basis Functions</B>,
p. 604-606.<BR>
Schneider, Philip J.,
<B>Solving the Nearest-Point-on-Curve Problem</B>,
p. 607-611, code: p. 787-796, <a href="gems/NearestPoint.c">NearestPoint.c</a>.<BR>
Schneider, Philip J.,
<B>An Algorithm for Automatically Fitting Digitized Curves</B>,
p. 612-626, code: p. 797-807, <a href="gems/FitCurves.c">FitCurves.c</a>.<BR>
Glassner, Andrew,
<B>Graphics Gems Header File</B>,
p. 629-632, code: p. 629-632, <a href="gems/GraphicsGems.h">GraphicsGems.h</a>.<BR>
Glassner, Andrew,
<B>2D and 3D Vector C Library</B>,
p. 633-642, code: p. 633-642, <a href="gems/GGVecLib.c">GGVecLib.c</a> <a href="gems/GraphicsGems.h">GraphicsGems.h</a>.<BR>
Hultquist, Jeff,
<B>Memory Allocation in C</B>,
p. 643, code: p. 643.<BR>
Raible, Eric,
<B>Two Useful C Macros</B>,
p. 644, code: p. 644.<BR>
Thompson, Kelvin,
<B>How to Build Circular Structures in C</B>,
p. 645, code: p. 645.<BR>
Thompson, Kelvin,
<B>How to Use C Register Variables to Point to 2D Arrays</B>,
p. 646, code: p. 646.<BR>
<P><H2><a name="gemsii">Graphics Gems II</a></H2>Rokne, Jon,
<B>The Area of a Simple Polygon</B>,
p. 5-6.<BR>
Prasad, Mukesh,
<B>Intersection of Line Segments</B>,
p. 7-9, code: p. 473-476, <a href="gemsii/xlines.c">xlines.c</a>.<BR>
Morrison, Jack C.,
<B>Distance From a Point To a Line</B>,
p. 10-13.<BR>
Rokne, Jon,
<B>An Easy Bounding Circle</B>,
p. 14-16.<BR>
Rokne, Jon,
<B>The Smallest Circle Containing the Intersection of Two Circles</B>,
p. 17-18.<BR>
Rokne, Jon,
<B>Appolonius's 10th Problem</B>,
p. 19-24.<BR>
Musgrave, F. Kenton,
<B>A Peano Curve Generation Algorithm</B>,
p. 25, code: p. 477-484, <a href="gemsii/Peano/">Peano/</a>.<BR>
Voorhies, Douglas,
<B>Space-Filling Curves and a Measure of Coherence</B>,
p. 26-30, code: p. 485-486, <a href="gemsii/Hilbert.c">Hilbert.c</a>.<BR>
Steinhart, Jonathan E.,
<B>Scanline Coherent Shape Algebra</B>,
p. 31-45, code: p. 487-501.<BR>
Schumacher, Dale A.,
<B>Image Smoothing and Sharpening by Discrete Convolution</B>,
p. 50-56.<BR>
Schumacher, Dale A.,
<B>A Comparison of Digital Halftoning Techniques</B>,
p. 57-71, code: p. 502-508.<BR>
Thomas, Spencer W., and Bogart, Rod G.,
<B>Color Dithering</B>,
p. 72-77, code: p. 509-513, <a href="gemsii/dither/">dither/</a>.<BR>
Schumacher, Dale A.,
<B>Fast Anamorphic Image Scaling</B>,
p. 78-79.<BR>
Ward, Greg,
<B>Real Pixels</B>,
p. 80-83, code: <a href="gemsii/RealPixels/">RealPixels/</a>.<BR>
Yap, Sue-Ken,
<B>A Fast 90-Degree Bitmap Rotator</B>,
p. 84-85, code: p. 514-515, <a href="gemsii/rotate8x8.c">rotate8x8.c</a>.<BR>
Holt, Jeff,
<B>Rotation of Run-Length Encoded Image Data</B>,
p. 86-88, code: p. 516-524.<BR>
Glassner, Andrew,
<B>Adaptive Run-Length Encoding</B>,
p. 89-92.<BR>
Paeth, Alan W.,
<B>Image File Compression Made Easy</B>,
p. 93-100.<BR>
Max, Nelson L.,
<B>An Optimal Filter for Image Reconstruction</B>,
p. 101-104.<BR>
Schlag, John,
<B>Noise Thresholding in Edge Images</B>,
p. 105-106.<BR>
Bieri, Hanspeter, and Kohler, Andreas,
<B>Computing the Area, the Circumference, and the Genus of a Binary Digital Image</B>,
p. 107-111, code: p. 525-527.<BR>
Thomas, Spencer W.,
<B>Efficient Inverse Color Map Computation</B>,
p. 116-125, code: p. 528-535, <a href="gemsii/inv_cmap/">inv_cmap/</a>.<BR>
Wu, Xiaolin,
<B>Efficient Statistical Computations for Optimal Color Quantization</B>,
p. 126-133, code: <a href="gemsii/quantizer.c">quantizer.c</a>.<BR>
Musgrave, F. Kenton,
<B>A Random Color Map Animation Algorithm</B>,
p. 134-137, code: p. 536-541, <a href="gemsii/ran_ramp.c">ran_ramp.c</a>.<BR>
Hall, Jim, and Lindgren, Terence,
<B>A Fast Approach To PHIGS PLUS Pseudo Color</B>,
p. 138-142.<BR>
Paeth, Alan W.,
<B>Mapping RGB Triples Onto 16 Distinct Values</B>,
p. 143-146.<BR>
Martindale, David, and Paeth, Alan W.,
<B>Television Color Encoding and "Hot" Broadcast Colors</B>,
p. 147-158, code: p. 542-549, <a href="gemsii/hot.c">hot.c</a>.<BR>
Meyer, Gary W.,
<B>An Inexpensive Method of Setting the Monitor White Point</B>,
p. 159-162.<BR>
Musgrave, F. Kenton,
<B>Some Tips for Making Color Hardcopy</B>,
p. 163-165.<BR>
Goldman, Ronald,
<B>Area of Planar Polygons and Volume of Polyhedra</B>,
p. 170-171.<BR>
Shaffer, Clifford A.,
<B>Getting Around on a Sphere</B>,
p. 172-173.<BR>
Paeth, Alan W.,
<B>Exact Dihedral Metrics for Common Polyhedra</B>,
p. 174-178.<BR>
Glassner, Andrew,
<B>A Simple Viewing Geometry</B>,
p. 179-180.<BR>
Bogart, Rod G.,
<B>View Correlation</B>,
p. 181-190, code: p. 550-562, <a href="gemsii/viewcorr/">viewcorr/</a>.<BR>
Glassner, Andrew,
<B>Maintaining Winged-Edge Models</B>,
p. 191-201.<BR>
Montani, Claudio, and Scopigno, Roberto,
<B>Quadtree/Octree-to-Boundary Conversion</B>,
p. 202-218.<BR>
Maillot, Patrick-Gilles,
<B>Three-Dimensional Homogeneous Clipping of Triangle Strips</B>,
p. 219-231, code: p. 563-570.<BR>
Thalmann, Nadia Magnenat, Thalmann, Daniel, and Minh, Hong Tong,
<B>InterPhong Shading</B>,
p. 232-241, code: p. 571-574, <a href="gemsii/InterPhong.c">InterPhong.c</a>.<BR>
Haines, Eric,
<B>Fast Ray-Convex Polyhedron Intersection</B>,
p. 247-250, code: p. 575-576, <a href="gemsii/RayCPhdron.c">RayCPhdron.c</a>.<BR>
Cychosz, Joseph M.,
<B>Intersecting a Ray with An Elliptical Torus</B>,
p. 251-256, code: p. 577-580, <a href="gemsii/intersect/">intersect/</a>.<BR>
Voorhies, Douglas, and Kirk, David,
<B>Ray-Triangle Intersection Using Binary Recursive Subdivision</B>,
p. 257-263.<BR>
Kirk, David, and Arvo, James,
<B>Improved Ray Tagging for Voxel-Based Ray Tracing</B>,
p. 264-266.<BR>
Haines, Eric,
<B>Efficiency Improvements for Hierarchy Traversal in Ray Tracing</B>,
p. 267-272.<BR>
Pearce, Andrew,
<B>A Recursive Shadow Voxel Cache for Ray Tracing</B>,
p. 273-274, code: p. 581-582, <a href="gemsii/VoxelCache.c">VoxelCache.c</a>.<BR>
Pearce, Andrew,
<B>Avoiding Incorrect Shadow Intersections for Ray Tracing</B>,
p. 275-276.<BR>
Lee, Mark E., and Uselton, Samuel P.,
<B>A Body Color Model: Absorption Through Translucent Media</B>,
p. 277-282.<BR>
Lee, Mark E., and Uselton, Samuel P.,
<B>More Shadow Attenuation for Ray Tracing Transparent or Translucent Objects</B>,
p. 283-289.<BR>
Chen, Shenchang Eric,
<B>Implementing Progressive Radiosity with User-Provided Polygon Display Routines</B>,
p. 295-298, code: p. 583-597, <a href="gemsii/radiosity/">radiosity/</a>.<BR>
Beran-Koehn, Jeffrey C., and Pavicic, Mark J.,
<B>A Cubic Tetrahedral Adaptation of the Hemi-Cube Algorithm</B>,
p. 299-302.<BR>
Tampieri, Filippo,
<B>Fast Vertex Radiosity Update</B>,
p. 303-305, code: p. 598, <a href="gemsii/FastUpdate.c">FastUpdate.c</a>.<BR>
Shirley, Peter,
<B>Radiosity via Ray Tracing</B>,
p. 306-310.<BR>
Sillion, François,
<B>Detection of Shadow Boundaries for Adaptive Meshing in Radiosity</B>,
p. 311-315.<BR>
Thomas, Spencer W.,
<B>Decomposing a Matrix Into Simple Transformations</B>,
p. 320-323, code: p. 599-602, <a href="gemsii/unmatrix.c">unmatrix.c</a>.<BR>
Goldman, Ronald,
<B>Recovering the Data From the Transformation Matrix</B>,
p. 324-331.<BR>
Goldman, Ronald,
<B>Transformations as Exponentials</B>,
p. 332-337.<BR>
Goldman, Ronald,
<B>More Matrices and Transforms: Shear and Pseudo-Perspective</B>,
p. 338-341.<BR>
Wu, Kevin,
<B>Fast Matrix Inversion</B>,
p. 342-350, code: p. 603-605, <a href="gemsii/inverse.c">inverse.c</a>.<BR>
Shoemake, Ken,
<B>Quaternions and 4x4 Matrices</B>,
p. 351-354.<BR>
Arvo, James,
<B>Random Rotation Matrices</B>,
p. 355-356, code: p. 606-607, <a href="gemsii/rotate.c">rotate.c</a>.<BR>
Arvo, James,
<B>Classifying Small Sparse Matrices</B>,
p. 357-361, code: p. 608-609, <a href="gemsii/sparse.c">sparse.c</a>.<BR>
Shoemake, Ken,
<B>Bit Picking</B>,
p. 366-367.<BR>
Shoemake, Ken,
<B>Faster Fourier Transform</B>,
p. 368-370.<BR>
Paeth, Alan W., and Schilling, David,
<B>Of Integers, Fields, and Bit Counting</B>,
p. 371-376, code: p. 610-611, <a href="gemsii/BitCounting/">BitCounting/</a>.<BR>
Schlag, John,
<B>Using Geometric Constructions to Interpolate Orientation with Quaternions</B>,
p. 377-380.<BR>
Paeth, Alan W.,
<B>A Half-Angle Identity for Digital Computation: The Joys of the Halved Tangent</B>,
p. 381-386.<BR>
Musial, Christopher J.,
<B>An Integer Square Root Algorithm</B>,
p. 387-388, code: p. 612.<BR>
Capelli, Ron,
<B>Fast Approximation To the Arctangent</B>,
p. 389-391.<BR>
Ritter, Jack,
<B>Fast Sign of Cross Product Calculation</B>,
p. 392-393, code: p. 613-614.<BR>
Shoemake, Ken,
<B>Interval Sampling</B>,
p. 394-395.<BR>
Ward, Greg,
<B>A Recursive Implementation of the Perlin Noise Function</B>,
p. 396-401, code: p. 615-616, <a href="gemsii/noise3.c">noise3.c</a>.<BR>
Moore, Doug, and Warren, Joseph,
<B>Least-Squares Approximations To Bézier Curves and Surfaces</B>,
p. 406-411.<BR>
Shoemake, Ken,
<B>Beyond Bézier Curves</B>,
p. 412-416.<BR>
Schlag, John,
<B>A Simple Formulation for Curve Interpolation with Variable Control Point Approximation</B>,
p. 417-419.<BR>
Lindgren, Terence,
<B>Symmetric Evaluation of Polynomials</B>,
p. 420-423.<BR>
Seidel, Hans-Peter,
<B>Menelaus's Theorem</B>,
p. 424-427.<BR>
Seidel, Hans-Peter,
<B>Geometrically Continuous Cubic Bézier Curves</B>,
p. 428-434.<BR>
Musial, Christopher J.,
<B>A Good Straight-Line Approximation of a Circular Arc</B>,
p. 435-439, code: p. 617.<BR>
Paeth, Alan W.,
<B>Great Circle Plotting</B>,
p. 440-445.<BR>
Wu, Xiaolin,
<B>Fast Anti-Aliased Circle Generation</B>,
p. 446-450.<BR>
Glassner, Andrew,
<B>Graphics Gems Header File</B>,
p. 455-457, code: p. 629-632, <a href="gemsii/GraphicsGems.h">GraphicsGems.h</a>.<BR>
Glassner, Andrew, and Bogart, Rod G.,
<B>2D and 3D Vector C Library</B>,
p. 458-466, code: p. 633-642, <a href="gemsii/GGVecLib.c">GGVecLib.c</a> <a href="gemsii/GraphicsGems.h">GraphicsGems.h</a>.<BR>
Hollasch, Steve,
<B>Useful C Macros for Vector Operations</B>,
p. 467-469, code: p. 467-469, <a href="gemsii/vector.h">vector.h</a>.<BR>
<P><H2><a name="gemsiii">Graphics Gems III</a></H2>Möller, Tomas,
<B>Fast Bitmap Stretching</B>,
p. 4-7, code: p. 411-413, <a href="gemsiii/fastBitmap.c">fastBitmap.c</a>.<BR>
Schumacher, Dale A.,
<B>General Filtered Image Rescaling</B>,
p. 8-16, code: p. 414-424, <a href="gemsiii/filter.c">filter.c</a> <a href="gemsiii/filter_rcg.c">filter_rcg.c</a>.<BR>
Schumacher, Dale A.,
<B>Optimization of Bitmap Scaling Operations</B>,
p. 17-19, code: p. 425-428, <a href="gemsiii/bitmap.c">bitmap.c</a>.<BR>
Bragg, Dennis,
<B>A Simple Color Reduction Filter</B>,
p. 20-22, code: p. 429-431, <a href="gemsiii/rgbvary.c">rgbvary.c</a> <a href="gemsiii/rgbvaryW.c">rgbvaryW.c</a>.<BR>
Moore, Doug, and Warren, Joseph,
<B>Compact Isocontours From Sampled Data</B>,
p. 23-28.<BR>
Feldman, Tim,
<B>Generating Iso-value Contours From a Pixmap</B>,
p. 29-33, code: p. 432-440, <a href="gemsiii/contour.c">contour.c</a>.<BR>
Salesin, David, and Barzel, Ronen,
<B>Compositing Black-and-White Bitmaps</B>,
p. 34-35.<BR>
Scofield, Cary,
<B>2-1/2-d Depth-of-Field Simulation for Computer Animation</B>,
p. 36-38.<BR>
Furman, Eric,
<B>A Fast Boundary Generator for Composited Regions</B>,
p. 39-43, code: p. 441-445, <a href="gemsiii/scallops8.c">scallops8.c</a>.<BR>
Hill, Steve,
<B>IEEE Fast Square Root</B>,
p. 48, code: p. 446-447, <a href="gemsiii/sqrt.c">sqrt.c</a>.<BR>
Hill, Steve,
<B>A Simple Fast Memory Allocator</B>,
p. 49-50, code: p. 448-451, <a href="gemsiii/alloc/">alloc/</a>.<BR>
Hanson, Andrew J.,
<B>The Rolling Ball</B>,
p. 51-60, code: p. 452-453, <a href="gemsiii/3d.c">3d.c</a> <a href="gemsiii/defs.h">defs.h</a>.<BR>
Rokne, Jon,
<B>Interval Arithmetic</B>,
p. 61-66, code: p. 454-457, <a href="gemsiii/interval.C">interval.C</a>.<BR>
Paeth, Alan W.,
<B>Fast Generation of Cyclic Sequences</B>,
p. 67-76, code: p. 458-459, <a href="gemsiii/cyclic.c">cyclic.c</a>.<BR>
Paeth, Alan W.,
<B>A Generic Pixel Selection Mechanism</B>,
p. 77-79.<BR>
Shirley, Peter,
<B>Nonuniform Random Point Sets</B>,
p. 80-83.<BR>
Goldman, Ronald,
<B>Cross Product in Four Dimensions and Beyond</B>,
p. 84-88.<BR>
Badouel, Didier, and Wuthrich, Charles A.,
<B>Face-Connected Line Segment Generation in an n-Dimensional Space</B>,
p. 89-91, code: p. 460, <a href="gemsiii/ndline.c">ndline.c</a>.<BR>
Morrison, Jack C.,
<B>Quaternion Interpolation with Extra Spins</B>,
p. 96-97, code: p. 461-462, <a href="gemsiii/quatspin.c">quatspin.c</a>.<BR>
Goldman, Ronald,
<B>Decomposing Projective Transformations</B>,
p. 98-107.<BR>
Goldman, Ronald,
<B>Decomposing Linear and Affine Transformations</B>,
p. 108-116.<BR>
Arvo, James,
<B>Fast Random Rotation Matrices</B>,
p. 117-120, code: p. 463-464, <a href="gemsiii/rand_rotation.c">rand_rotation.c</a>.<BR>
Dana, Paul,
<B>Issues and Techniques for Keyframing Transformations</B>,
p. 121-123.<BR>
Shoemake, Ken,
<B>Uniform Random Rotations</B>,
p. 124-132, code: p. 465-467, <a href="gemsiii/urot.c">urot.c</a>.<BR>
Elber, Gershon,
<B>Interpolation Using Bézier Curves</B>,
p. 133-136, code: p. 468-471, <a href="gemsiii/bzrinter.c">bzrinter.c</a>.<BR>
Barr, A.H.,
<B>Physically Based Superquadrics</B>,
p. 137-159, code: p. 472-477, <a href="gemsiii/sqfinal.c">sqfinal.c</a>.<BR>
Van Aken, Jerry, and Simar, Ray,
<B>A Parametric Elliptical Arc Algorithm</B>,
p. 164-172, code: p. 478-479, <a href="gemsiii/parelarc.c">parelarc.c</a>.<BR>
Rosati, Claudio,
<B>A Simple Connection Algorithm for 2-D Drawing</B>,
p. 173-181, code: p. 480-486, <a href="gemsiii/con2d.c">con2d.c</a>.<BR>
Srinivasan, Raman V.,
<B>A Fast Circle Clipping Algorithm</B>,
p. 182-187, code: p. 487-490, <a href="gemsiii/circlexc.c">circlexc.c</a>.<BR>
Shaffer, Clifford A., and Feustel, Charles D.,
<B>Exact Computation of 2-D Intersections</B>,
p. 188-192, code: p. 491-495, <a href="gemsiii/Polyintr.c">Polyintr.c</a>.<BR>
Miller, Robert D.,
<B>Joining Two Lines with a Circular Arc Fillet</B>,
p. 193-198, code: p. 496-499, <a href="gemsiii/fillet.c">fillet.c</a>.<BR>
Antonio, Franklin,
<B>Faster Line Segment Intersection</B>,
p. 199-202, code: p. 500-501, <a href="gemsiii/insectc.c">insectc.c</a>.<BR>
Sevici, Constantin A.,
<B>Solving the Problem of Apollonius and Other Related Problems</B>,
p. 203-209.<BR>
López-López, Fernando J.,
<B>Triangles Revisited</B>,
p. 215-218.<BR>
Chin, Norman,
<B>Partitioning a 3-D Convex Polygon with an Arbitrary Plane</B>,
p. 219-222, code: p. 502-510, <a href="gemsiii/partition3d/">partition3d/</a>.<BR>
Georgiades, Príamos,
<B>Signed Distance From Point To Plane</B>,
p. 223-224, code: p. 511, <a href="gemsiii/pt2plane.c">pt2plane.c</a>.<BR>
Salesin, David, and Tampieri, Filippo,
<B>Grouping Nearly Coplanar Polygons Into Coplanar Sets</B>,
p. 225-230, code: p. 512-516, <a href="gemsiii/planeSets.c">planeSets.c</a>.<BR>
Tampieri, Filippo,
<B>Newell's Method for the Plane Equation of a Polygon</B>,
p. 231-232, code: p. 517-518, <a href="gemsiii/newell.c">newell.c</a>.<BR>
Georgiades, Príamos,
<B>Plane-to-Plane Intersection</B>,
p. 233-235, code: p. 519-520, <a href="gemsiii/pl2plane.c">pl2plane.c</a>.<BR>
Voorhies, Douglas,
<B>Triangle-Cube Intersection</B>,
p. 236-239, code: p. 521-526, <a href="gemsiii/triangleCube.c">triangleCube.c</a>.<BR>
Wanger, Len, and Fusco, Mike,
<B>Fast N-Dimensional Extent Overlap Testing</B>,
p. 240-243, code: p. 527-533, <a href="gemsiii/exttest/">exttest/</a>.<BR>
Moore, Doug,
<B>Subdividing Simplices</B>,
p. 244-249, code: p. 534-535, <a href="gemsiii/simplex/">simplex/</a>.<BR>
Moore, Doug,
<B>Understanding Simploids</B>,
p. 250-255.<BR>
Lischinski, Dani,
<B>Converting Bézier Triangles Into Rectangular Patches</B>,
p. 256-261, code: p. 536-537, <a href="gemsiii/bezierTri.C">bezierTri.C</a>.<BR>
Lindgren, Terence, Sanchez, Juan, and Hall, Jim,
<B>Curve Tessellation Criteria Thru Sampling</B>,
p. 262-265.<BR>
Sung, Kelvin, and Shirley, Peter,
<B>Ray Tracing with the BSP Tree</B>,
p. 271-274, code: p. 538-546, <a href="gemsiii/bsp.c">bsp.c</a>.<BR>
Cychosz, Joseph M., and Waggenspack, Warren N., Jr.,
<B>Intersecting a Ray with a Quadric Surface</B>,
p. 275-283, code: p. 547-550, <a href="gemsiii/intqdr.c">intqdr.c</a> <a href="gemsiii/intell.c">intell.c</a>.<BR>
Cychosz, Joseph M.,
<B>Use of Residency Masks and Object Space Partitioning to Eliminate Ray-Object Intersection Calculations</B>,
p. 284-287.<BR>
Musgrave, F. Kenton,
<B>A Panoramic Virtual Screen for Ray Tracing</B>,
p. 288-294, code: p. 551-554, <a href="gemsiii/panorama.c">panorama.c</a>.<BR>
Trumbore, Ben,
<B>Rectangular Bounding Volumes for Popular Primitives</B>,
p. 295-300, code: p. 555-561, <a href="gemsiii/bounding_volumes.c">bounding_volumes.c</a>.<BR>
Wu, Xiaolin,
<B>A Linear-Time Simple Bounding Volume Algorithm</B>,
p. 301-306.<BR>
Wang, Changyaw,
<B>Physically Correct Direct Lighting for Distribution Ray Tracing</B>,
p. 307-313, code: p. 562-568, <a href="gemsiii/luminaire/">luminaire/</a>.<BR>
Bian, Buming,
<B>Hemispherical Projection of a Triangle</B>,
p. 314-317, code: p. 569-574, <a href="gemsiii/hemis.c">hemis.c</a>.<BR>
Max, Nelson L., and Allison, Michael J.,
<B>Linear Radiosity Approximation Using Vertex-to-Vertex Form Factors</B>,
p. 318-323.<BR>
Beran-Koehn, Jeffrey C., and Pavicic, Mark J.,
<B>Delta Form-Factor Calculation for the Cubic Tetrahedral Algorithm</B>,
p. 324-328, code: p. 575-576, <a href="gemsiii/forfac.c">forfac.c</a>.<BR>
Tampieri, Filippo,
<B>Accurate Form-Factor Computation</B>,
p. 329-333, code: p. 577-581, <a href="gemsiii/accForm.c">accForm.c</a>.<BR>
Woo, Andrew,
<B>The Shadow Depth Map Revisited</B>,
p. 338-342, code: p. 582, <a href="gemsiii/zdepth.c">zdepth.c</a>.<BR>
Cheng, Russell C.H.,
<B>Fast Linear Color Rendering</B>,
p. 343-348, code: p. 583-585, <a href="gemsiii/fastLinear.c">fastLinear.c</a>.<BR>
Cheng, Russell C.H.,
<B>Edge and Bit-Mask Calculations for Anti-Aliasing</B>,
p. 349-354, code: p. 586-593, <a href="gemsiii/edgeCalc.c">edgeCalc.c</a>.<BR>
Grace, Thom,
<B>Fast Span Conversion: Unrolling Short Loops</B>,
p. 355-357, code: p. 594-596, <a href="gemsiii/fastSpan.c">fastSpan.c</a>.<BR>
Hollasch, Steve,
<B>Progressive Image Refinement via Gridded Sampling</B>,
p. 358-361, code: p. 597-598, <a href="gemsiii/PIR.c">PIR.c</a>.<BR>
Fleischer, Kurt, and Salesin, David,
<B>Accurate Polygon Scan Conversion Using Half-Open Intervals</B>,
p. 362-365, code: p. 599-605, <a href="gemsiii/accurate_scan/">accurate_scan/</a>.<BR>
Glassner, Andrew,
<B>Darklights</B>,
p. 366-368.<BR>
Glassner, Andrew,
<B>Anti-Aliasing in Triangular Pixels</B>,
p. 369-373.<BR>
Snyder, John, Barzel, Ronen, and Gabriel, Steve,
<B>Motion Blur on Graphics Workstations</B>,
p. 374-382, code: p. 606-609, <a href="gemsiii/motblur.c">motblur.c</a>.<BR>
Arvo, James, and Scofield, Cary,
<B>The Shader Cache: A Rendering Pipeline Accelerator</B>,
p. 383-389.<BR>
Glassner, Andrew,
<B>Graphics Gems Header File</B>,
p. 455-457, code: p. 393-395, <a href="gemsiii/GraphicsGems.h">GraphicsGems.h</a>.<BR>
Glassner, Andrew,
<B>2-D and 3-D Vector C Library -- Corrected and Indexed</B>,
p. 396-404, code: p. 396-404, <a href="gemsiii/GraphicsGems.c">GraphicsGems.c</a>.<BR>
Hollasch, Steve,
<B>Useful C Macros for Vector Operations</B>,
p. 405-407, code: p. 405-407, <a href="gemsiii/vector.h">vector.h</a>.<BR>
<P><H2><a name="gemsiv">Graphics Gems IV</a></H2>Bashein, Gerard, and Detmer, Paul R.,
<B>Centroid of a Polygon</B>,
p. 3-6, code: p. 5, <a href="gemsiv/centroid.c">centroid.c</a>.<BR>
Schorn, Peter, and Fisher, Frederick,
<B>Testing the Convexity of a Polygon</B>,
p. 7-15, code: p. 11-15, <a href="gemsiv/convex_test/">convex_test/</a>.<BR>
Weiler, Kevin,
<B>An Incremental Angle Point in Polygon Test</B>,
p. 16-23, code: p. 17-22, <a href="gemsiv/ptpoly_weiler/">ptpoly_weiler/</a>.<BR>
Haines, Eric,
<B>Point in Polygon Strategies</B>,
p. 24-46, code: p. 34-45, <a href="gemsiv/ptpoly_haines/">ptpoly_haines/</a>.<BR>
Lischinski, Dani,
<B>Incremental Delaunay Triangulation</B>,
p. 47-59, code: p. 51-58, <a href="gemsiv/delaunay/">delaunay/</a>.<BR>
Glassner, Andrew,
<B>Building Vertex Normals from an Unstructured Polygon List</B>,
p. 60-73, code: p. 64-73, <a href="gemsiv/vert_norm/">vert_norm/</a>.<BR>
Greene, Ned,
<B>Detecting Intersection of a Rectangular Solid and a Convex Polyhedron</B>,
p. 74-82.<BR>
Rabbitz, Rich,
<B>Fast Collision Detection of Moving Convex Polyhedra</B>,
p. 83-109, code: p. 91-108, <a href="gemsiv/collide.c">collide.c</a>.<BR>
Hart, John C.,
<B>Distance to an Ellipsoid</B>,
p. 113-119.<BR>
Ohashi, Yoshikazu,
<B>Fast Linear Approximations of Euclidean Distance in Higher Dimensions</B>,
p. 121-124, code: <a href="gemsiv/dist_fast.c">dist_fast.c</a>.<BR>
Donovan, Walt, and Van Hook, Tim,
<B>Direct Outcode Calculation for Faster Clip Testing</B>,
p. 125-131, code: p. 127-131, <a href="gemsiv/outcode/">outcode/</a>.<BR>
Miller, Robert D.,
<B>Computing the Area of a Spherical Polygon</B>,
p. 132-137, code: p. 135-136, <a href="gemsiv/sph_poly.c">sph_poly.c</a>.<BR>
Hill, F. S., Jr.,
<B>The Pleasures of `Perp Dot' Products</B>,
p. 138-148.<BR>
Hanson, Andrew J.,
<B>Geometry for N-Dimensional Graphics</B>,
p. 149-170.<BR>
Shoemake, Ken,
<B>Arcball Rotation Control</B>,
p. 175-192, code: p. 178-191, <a href="gemsiv/arcball/">arcball/</a>.<BR>
Cromwell, Robert L.,
<B>Efficient Eigenvalues for Visualization</B>,
p. 193-198.<BR>
Wu, Kevin,
<B>Fast Inversion of Length- and Angle-Preserving Matrices</B>,
p. 199-206, code: p. 204-206, <a href="gemsiv/inv_fast.c">inv_fast.c</a>.<BR>
Shoemake, Ken,
<B>Polar Matrix Decomposition</B>,
p. 207-221, code: p. 211-220, <a href="gemsiv/polar_decomp/">polar_decomp/</a>.<BR>
Shoemake, Ken,
<B>Euler Angle Conversion</B>,
p. 222-229, code: p. 225-228, <a href="gemsiv/euler_angle/">euler_angle/</a>.<BR>
Shoemake, Ken,
<B>Fiber Bundle Twist Reduction</B>,
p. 230-236.<BR>
Eilers, Paul H. C.,
<B>Smoothing and Interpolation with Finite Differences</B>,
p. 241-250, code: p. 246-249, <a href="gemsiv/data_smooth/">data_smooth/</a>.<BR>
Barry, Phillip, and Goldman, Ronald,
<B>Knot Insertion using Forward Differences</B>,
p. 251-255.<BR>
Bajaj, Chandrajit, and Xu, Guoliang,
<B>Converting a Rational Curve to a Standard Rational Bernstein-Bézier Representation</B>,
p. 256-260.<BR>
Klassen, R. Victor,
<B>Intersecting Parametric Cubic Curves by Midpoint Subdivision</B>,
p. 261-277, code: p. 266-276, <a href="gemsiv/curve_isect/">curve_isect/</a>.<BR>
Lischinski, Dani,
<B>Converting Rectangular Patches into Bézier Triangles</B>,
p. 278-285, code: p. 281-285, <a href="gemsiv/patch_conv.C">patch_conv.C</a>.<BR>
Peterson, John W.,
<B>Tessellation of NURB Surfaces</B>,
p. 286-320, code: p. 294-319, <a href="gemsiv/nurb_polyg/">nurb_polyg/</a>.<BR>
Shene, Ching-Kuang,
<B>Equations of Cylinders and Cones</B>,
p. 321-323.<BR>
Bloomenthal, Jules,
<B>An Implicit Surface Polygonizer</B>,
p. 324-349, code: p. 334-349, <a href="gemsiv/implicit.c">implicit.c</a>.<BR>
Shene, Ching-Kuang,
<B>Computing the Intersection of a Line and a Cylinder</B>,
p. 353-355.<BR>
Cychosz, Joseph M., and Waggenspack, Warren N., Jr.,
<B>Intersecting a Ray with a Cylinder</B>,
p. 356-365, code: p. 361-364, <a href="gemsiv/ray_cyl.c">ray_cyl.c</a>.<BR>
Cohen, Daniel,
<B>Voxel Traversal along a 3D Line</B>,
p. 366-369, code: p. 368, <a href="gemsiv/vox_traverse.c">vox_traverse.c</a>.<BR>
Chiu, Kenneth, Shirley, Peter, and Wang, Changyaw,
<B>Multi-Jittered Sampling</B>,
p. 370-374, code: p. 373-374, <a href="gemsiv/multi_jitter/">multi_jitter/</a>.<BR>
Heckbert, Paul S.,
<B>A Minimal Ray Tracer</B>,
p. 375-381, code: p. 378-380, <a href="gemsiv/minray/">minray/</a>.<BR>
Schlick, Christophe,
<B>A Fast Alternative to Phong's Specular Model</B>,
p. 385-387.<BR>
Fisher, Frederick, and Woo, Andrew,
<B>R.E versus N.H Specular Highlights</B>,
p. 388-400.<BR>
Schlick, Christophe,
<B>Fast Alternatives to Perlin's Bias and Gain Functions</B>,
p. 401-403.<BR>
Behrens, Uwe,
<B>Fence Shading</B>,
p. 404-409.<BR>
Kopp, Manfred, and Gervautz, Michael,
<B>XOR-Drawing with Guaranteed Contrast</B>,
p. 413-414.<BR>
Ward, Greg,
<B>A Contrast-Based Scalefactor for Luminance Display</B>,
p. 415-421.<BR>
Schlick, Christophe,
<B>High Dynamic Range Pixels</B>,
p. 422-429, code: p. 425-428, <a href="gemsiv/dyn_range/">dyn_range/</a>.<BR>
Schlag, John,
<B>Fast Embossing Effects on Raster Image Data</B>,
p. 433-437, code: p. 435-436, <a href="gemsiv/emboss.c">emboss.c</a>.<BR>
Heckbert, Paul S.,
<B>Bilinear Coons Patch Image Warping</B>,
p. 438-446, code: p. 441-444, <a href="gemsiv/coons_warp.c">coons_warp.c</a>.<BR>
Wolberg, George, and Massalin, Henry,
<B>Fast Convolution with Packed Lookup Tables</B>,
p. 447-464, code: p. 455-463, <a href="gemsiv/convolve.c">convolve.c</a>.<BR>
Cychosz, Joseph M.,
<B>Efficient Binary Image Thinning using Neighborhood Maps</B>,
p. 465-473, code: p. 470-472, <a href="gemsiv/thin_image.c">thin_image.c</a>.<BR>
Zuiderveld, Karel,
<B>Contrast Limited Adaptive Histogram Equalization</B>,
p. 474-485, code: p. 479-484, <a href="gemsiv/clahe.c">clahe.c</a>.<BR>
Paeth, Alan W.,
<B>Ideal Tiles for Shading and Halftoning</B>,
p. 486-492.<BR>
Christensen, Jon, Marks, Joe, and Shieber, Stuart,
<B>Placing Text Labels on Maps and Diagrams</B>,
p. 497-504.<BR>
Szirmay-Kalos, László,
<B>Dynamic Layout Algorithm to Display General Graphs</B>,
p. 505-517, code: p. 511-517, <a href="gemsiv/graph_layout/">graph_layout/</a>.<BR>
Hill, Steve,
<B>Tri-linear Interpolation</B>,
p. 521-525, code: p. 523-524, <a href="gemsiv/trilerp.c">trilerp.c</a>.<BR>
Eker, Steven,
<B>Faster Linear Interpolation</B>,
p. 526-533, code: p. 532-533, <a href="gemsiv/interp_fast.c">interp_fast.c</a>.<BR>
Doué, Jean-François,
<B>C++ Vector and Matrix Algebra Routines</B>,
p. 534-557, code: p. 535-557, <a href="gemsiv/vec_mat/">vec_mat/</a>.<BR>
Glassner, Andrew, and Haines, Eric,
<B>C Header File and Vector Library</B>,
p. 558-570, code: p. 558-570, <a href="gemsiv/GraphicsGems.c">GraphicsGems.c</a> <a href="gemsiv/GraphicsGems.h">GraphicsGems.h</a>.<BR>
<P><H2><a name="gemsv">Graphics Gems V</a></H2>Herbison-Evans, Don,
<B>Solving Quartics and Cubics for Graphics</B>,
p. 3-15, code: <a href="gemsv/ch1-1/">ch1-1/</a>.<BR>
Turkowski, Ken,
<B>Computing the Inverse Square Root</B>,
p. 16-21, code: p. 17-19, <a href="gemsv/ch1-2/">ch1-2/</a>.<BR>
Turkowski, Ken,
<B>Fixed Point Square Root</B>,
p. 22-24, code: p. 23, <a href="gemsv/ch1-3/">ch1-3/</a>.<BR>
Shoemake, Ken,
<B>Rational Approximation</B>,
p. 25-32, code: p. 29-31, <a href="gemsv/ch1-4/">ch1-4/</a>.<BR>
Van Gelder, Allen,
<B>Efficient Computation of Polygon Area and Polyhedron Volume</B>,
p. 35-41.<BR>
Carvalho, Paulo Cezar Pinto, and Cavalcanti, Paulo Roma,
<B>Point in Polyhedron Testing Using Spherical Polygons</B>,
p. 42-49, code: p. 46-49, <a href="gemsv/ch2-2/">ch2-2/</a>.<BR>
Glassner, Andrew,
<B>Clipping a Concave Polygon</B>,
p. 50-54.<BR>
Hanson, Andrew J.,
<B>Rotations for N-dimensional Graphics</B>,