-
Notifications
You must be signed in to change notification settings - Fork 74
/
bibliography.bib
5919 lines (5501 loc) · 363 KB
/
bibliography.bib
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
# preface
@article{10.1093/comjnl/27.2.97,
author = {Knuth, Donald Ervin},
title = {Literate Programming},
journal = {The Computer Journal},
volume = {27},
number = {2},
pages = {97-111},
year = {1984},
month = {01},
abstract = {{The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones.}},
issn = {0010-4620},
doi = {10.1093/comjnl/27.2.97},
eprint = {https://academic.oup.com/comjnl/article-pdf/27/2/97/981657/270097.pdf}
}
@book{10.5555/536126,
author = {Knuth, Donald Ervin},
title = {{M}etafont: The Program},
year = {1986},
isbn = {0201134381},
publisher = {Addison-Wesley Longman Publishing Co., Inc.},
address = {USA},
edition = {1st}
}
@book{10.5555/536123,
author = {Knuth, Donald Ervin},
title = {{TEX}: The Program},
year = {1986},
isbn = {0201134373},
publisher = {Addison-Wesley Longman Publishing Co., Inc.},
address = {USA}
}
@book{10.1145/164984,
author = {Knuth, Donald Ervin},
title = {The Stanford GraphBase: A Platform for Combinatorial Computing},
year = {1993},
isbn = {0201542757},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA}
}
@book{10.5555/555424,
author = {Fraser, Christopher W. and Hanson, David R.},
title = {A Retargetable {C} Compiler: Design and Implementation},
year = {1995},
isbn = {0805316701},
publisher = {Addison-Wesley Longman Publishing Co., Inc.},
address = {USA},
abstract = {From the Publisher:This new text examines the design and implementation of Icc, a production-quality, retargetable compiler, designed at AT&T Bell Laboratories and Princeton University for the ANSI C programming language. The authors' innovative approach - a "literate program" that intermingles the text with the source code - gives a detailed tour of the code that explains the implementation and design decisions reflected in the software. And while most books describe toy compilers or focus on isolated pieces of code, the authors have made available the entire source code for a real compiler. Structured as a self-study guide that describes the real-world tradeoffs encountered in building a production-quality compiler, A Retargetable C Compiler is also useful to individuals who work in application areas using or creating language-based tools and techniques. Features: discusses the implementation and design tradeoffs made while constructing a real ANSI C compiler, illustrating the interaction between theory and practice; covers compiler theory only as needed to understand the implementation of Icc, focusing instead on practical, applied issues; encourages a deeper understanding of programming in C, by providing C programmers with a tour of the language from the perspective of compiler authors; includes coverage of code generators for the MIPS R3000, SPARC, and Intel 386 and its successors; and provides access to the full source code for the Icc compiler, the three back ends, and the code-generator generator, either on disk or via FTP.}
}
@book{10.5555/1036653,
author = {Ruckert, Martin},
title = {Understanding {MP3}},
year = {2005},
isbn = {3528059052},
publisher = {Friedr. Vieweg \& Sohn Verlag/GWV Fachverlage GmbH},
address = {Wiesbaden, Germany}
}
#prefaceonline
@book{4b212a02-105c-42a2-ad5c-91c16a06e815,
author = {Ström, Jakob O and Åström, Karl and Akenine-Möller, Tomas},
isbn = {978-91-637-9354-7},
language = {eng},
publisher = {ImmersiveMath},
title = {Immersive Linear Algebra},
url = {http://immersivemath.com/ila/},
year = {2015}
}
@book{978-1138627000,
author = {Tomas Akenine-M\"{o}ller and Eric Haines and Naty Hoffman and Angelo Pesce and Micha\l{} Iwanicki and S\'{e}bastien Hillaire},
publisher = {A. K. Peters/CRC Press},
title = {Real-Time Rendering},
year = {2018},
month = {8},
edition = {4},
pages = {1200},
isbn = {978-1-13862-700-0},
address = {Boca Raton, FL, USA},
url = {https://www.realtimerendering.com/}
}
#chapter01
@article{10.1007/BF02684409,
author = {Szirmay-Kalos, L. and M\'{a}rton, G.},
title = {Worst-Case versus Average Case Complexity of Ray-Shooting},
year = {1998},
issue_date = {1998},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
volume = {61},
number = {2},
issn = {0010-485X},
doi = {10.1007/BF02684409},
journal = {Computing},
month = oct,
pages = {103-131},
numpages = {29},
keywords = {complexity, ray-shooting, computational geometry, stochastic analysis}
}
@article{10.1145/358876.358882,
author = {Whitted, Turner},
title = {An Improved Illumination Model for Shaded Display},
year = {1980},
issue_date = {June 1980},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {23},
number = {6},
issn = {0001-0782},
doi = {10.1145/358876.358882},
abstract = {To accurately render a two-dimensional image of a three-dimensional scene, global illumination information that affects the intensity of each pixel of the image must be known at the time the intensity is calculated. In a simplified form, this information is stored in a tree of “rays” extending from the viewer to the first surface encountered and from there to other surfaces and to the light sources. A visible surface algorithm creates this tree for each pixel of the display and passes it to the shader. The shader then traverses the tree to determine the intensity of the light received by the viewer. Consideration of all of these factors allows the shader to accurately simulate true reflection, shadows, and refraction, as well as the effects simulated by conventional shaders. Anti-aliasing is included as an integral part of the visibility calculations. Surfaces displayed include curved as well as polygonal surfaces.},
journal = {Commun. ACM},
month = jun,
pages = {343-349},
numpages = {7},
keywords = {computer animation, visible surface algorithms, computer graphics, shading, raster displays}
}
@inproceedings{10.1145/74333.74361,
author = {Kajiya, James T. and Kay, Timothy L.},
title = {Rendering Fur with Three Dimensional Textures},
year = {1989},
isbn = {0897913124},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/74333.74361},
abstract = {We present a method for rendering scenes with fine detail via an object called a texel, a rendering primitive inspired by volume densities mixed with anisotropic lighting models. This technique solves a long outstanding problem in image synthesis: the rendering of furry surfaces.},
booktitle = {Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {271-280},
numpages = {10},
series = {SIGGRAPH '89}
}
# 1.3.2
@book{10.5555/136311,
author = {Levine, John R. and Mason, Tony and Brown, Doug},
title = {Lex \& Yacc},
year = {1992},
isbn = {1565920007},
publisher = {O'Reilly \& Associates, Inc.},
address = {USA},
edition = {2}
}
# 2.extra
@inbook{10.5555/90767.90913,
author = {Maillot, Patrick-Gilles},
title = {Using Quaternions for Coding {3D} Transformations},
year = {1990},
isbn = {0122861695},
publisher = {Academic Press Professional, Inc.},
address = {USA},
booktitle = {Graphics Gems},
pages = {498-515},
numpages = {18}
}
@misc{enwiki:1013104981,
author = {{Wikipedia contributors}},
title = {Division ring --- {Wikipedia}{,} The Free Encyclopedia},
year = {2021},
howpublished = {\url{https://en.wikipedia.org/w/index.php?title=Division_ring&oldid=1013104981}},
note = {[Online; accessed 16-April-2021]}
}
# 1.7
@inproceedings{10.1145/800224.806819,
author = {Cook, Robert L. and Torrance, Kenneth E.},
title = {A Reflectance Model for Computer Graphics},
year = {1981},
isbn = {0897910451},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/800224.806819},
abstract = {This paper presents a new reflectance model for rendering computer synthesized images. The model accounts for the relative brightness of different materials and light sources in the same scene. It describes the directional distribution of the reflected light and a color shift that occurs as the reflectance changes with incidence angle. The paper presents a method for obtaining the spectral energy distribution of the light reflected from an object made of a specific real material and discusses a procedure for accurately reproducing the color associated with the spectral energy distribution. The model is applied to the simulation of a metal and a plastic.},
booktitle = {Proceedings of the 8th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {307-316},
numpages = {10},
keywords = {Reflectance, Computer graphics, Shading, Image synthesis},
location = {Dallas, Texas, USA},
series = {SIGGRAPH '81}
}
@article{10.1145/357290.357293,
author = {Cook, Robert L. and Torrance, Kenneth E.},
title = {A Reflectance Model for Computer Graphics},
year = {1982},
issue_date = {Jan. 1982},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {1},
number = {1},
issn = {0730-0301},
doi = {10.1145/357290.357293},
journal = {ACM Trans. Graph.},
month = {1},
pages = {7-24},
numpages = {18},
keywords = {image synthesis, reflectance}
}
@inproceedings{10.1145/800031.808601,
author = {Goral, Cindy M. and Torrance, Kenneth E. and Greenberg, Donald P. and Battaile, Bennett},
title = {Modeling the Interaction of Light between Diffuse Surfaces},
year = {1984},
isbn = {0897911385},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/800031.808601},
abstract = {A method is described which models the interaction of light between diffusely reflecting surfaces. Current light reflection models used in computer graphics do not account for the object-to-object reflection between diffuse surfaces, and thus incorrectly compute the global illumination effects. The new procedure, based on methods used in thermal engineering, includes the effects of diffuse light sources of finite area, as well as the “color-bleeding” effects which are caused by the diffuse reflections. A simple environment is used to illustrate these simulated effects and is presented with photographs of a physical model. The procedure is applicable to environments composed of ideal diffuse reflectors and can account for direct illumination from a variety of light sources. The resultant surface intensities are independent of observer position, and thus environments can be preprocessed for dynamic sequences.},
booktitle = {Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {213-222},
numpages = {10},
keywords = {Diffuse reflections, Shading, Radiosity, Light reflection models, Form factors},
series = {SIGGRAPH '84}
}
@inproceedings{10.1145/325334.325171,
author = {Cohen, Michael F. and Greenberg, Donald P.},
title = {The Hemi-Cube: A Radiosity Solution for Complex Environments},
year = {1985},
isbn = {0897911660},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/325334.325171},
abstract = {This paper presents a comprehensive method to calculate object to object diffuse reflections within complex environments containing hidden surfaces and shadows. In essence, each object in the environment is treated as a secondary light source. The method provides an accurate representation of the "diffuse" and "ambient" terms found in typical image synthesis algorithms. The phenomena of "color bleeding" from one surface to another, shading within shadow envelopes, and penumbras along shadow boundaries are accurately reproduced. Additional advantages result because computations are indepedent of viewer position. This allows the efficient rendering of multiple views of the same scene for dynamic sequences. Light sources can be modulated and object reflectivities can be changed, with minimal extra computation. The procedures extend the radiosity method beyond the bounds previously imposed.},
booktitle = {Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {31-40},
numpages = {10},
keywords = {hidden surface, form-factors, depth buffer, radiosity, diffuse reflections},
series = {SIGGRAPH '85}
}
@inproceedings{10.1145/325334.325169,
author = {Nishita, Tomoyuki and Nakamae, Eihachiro},
title = {Continuous Tone Representation of Three-Dimensional Objects Taking Account of Shadows and Interreflection},
year = {1985},
isbn = {0897911660},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/325334.325169},
abstract = {The effect of shadows and interreflection created by room obstructions is an important factor in the continuous tone representation of interiors. For indirect illumination, in most cases a uniform ambient light has been considered, even though the interreflection gives very complex effects with the shaded images.The proposed method for indirect lighting with shadows results in the following advanced points:1) The indirect illuminance caused by the surfaces of objects such as ceilings, floors, walls, desks, bookcases etc. gives added realism to images.2) The proposed method is suitable for every type of light source such as point sources, linear sources, and area sources.},
booktitle = {Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {23-30},
numpages = {8},
keywords = {diffuse reflections, penumbrae, interreflection of light, shading, area light source, shadows},
series = {SIGGRAPH '85}
}
@inproceedings{10.1145/800031.808590,
author = {Cook, Robert L. and Porter, Thomas and Carpenter, Loren},
title = {Distributed Ray Tracing},
year = {1984},
isbn = {0897911385},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/800031.808590},
abstract = { Ray tracing is one of the most elegant techniques in computer graphics. Many phenomena that are difficult or impossible with other techniques are simple with ray tracing, including shadows, reflections, and refracted light. Ray directions, however, have been determined precisely, and this has limited the capabilities of ray tracing. By distributing the directions of the rays according to the analytic function they sample, ray tracing can incorporate fuzzy phenomena. This provides correct and easy solutions to some previously unsolved or partially solved problems, including motion blur, depth of field, penumbras, translucency, and fuzzy reflections. Motion blur and depth of field calculations can be integrated with the visible surface calculations, avoiding the problems found in previous methods. },
booktitle = {Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {137-145},
numpages = {9},
keywords = {Transparency, Depth of field, Gloss, Shadows, Camera, Motion blur, Translucency, Penumbras, Constructive solid geometry, Focus, Ray tracing},
series = {SIGGRAPH '84}
}
@inproceedings{10.1145/15922.15902,
author = {Kajiya, James T.},
title = {The Rendering Equation},
year = {1986},
isbn = {0897911962},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/15922.15902},
abstract = {We present an integral equation which generalizes a variety of known rendering algorithms. In the course of discussing a monte carlo solution we also present a new form of variance reduction, called Hierarchical sampling and give a number of elaborations shows that it may be an efficient new technique for a wide variety of monte carlo procedures. The resulting rendering algorithm extends the range of optical phenomena which can be effectively simulated.},
booktitle = {Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {143-150},
numpages = {8},
series = {SIGGRAPH '86}
}
@article{farmer1981comparing,
title = {Comparing the 4341 and {M}80/42},
author = {Farmer, DF},
journal = {Computerworld},
volume = {15},
pages = {9-20},
year = {1981}
}
@inproceedings{10.1145/800031.808594,
author = {Kajiya, James T. and Von Herzen, Brian P},
title = {Ray Tracing Volume Densities},
year = {1984},
isbn = {0897911385},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/800031.808594},
abstract = {This paper presents new algorithms to trace objects represented by densities within a volume grid, e.g. clouds, fog, flames, dust, particle systems. We develop the light scattering equations, discuss previous methods of solution, and present a new approximate solution to the full three-dimensional radiative scattering problem suitable for use in computer graphics. Additionally we review dynamical models for clouds used to make an animated movie.},
booktitle = {Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {165-174},
numpages = {10},
keywords = {Light scattering, Stochastic modeling, Clouds, Radiative transport, Particle systems, Simulation of natural phenomena, Computer graphics, Ray tracing, Raster graphics},
series = {SIGGRAPH '84}
}
@inproceedings{10.1145/97879.97886,
author = {Arvo, James and Kirk, David},
title = {Particle Transport and Image Synthesis},
year = {1990},
isbn = {0897913442},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/97879.97886},
abstract = {The rendering equation is similar to the linear Boltzmann equation which has been widely studied in physics and nuclear engineering. Consequently, many of the powerful techniques which have been developed in these fields can be applied to problems in image synthesis. In this paper we adapt several statistical techniques commonly used in neutron transport to stochastic ray tracing and, more generally, to Monte Carlo solution of the rendering equation. First, we describe a technique known as Russian roulette which can be used to terminate the recursive tracing of rays without introducing statistical bias. We also examine the practice of creating ray trees in classical ray tracing in the light of a well-known technique in particle transport known as splitting. We show that neither ray trees nor paths as described in [10] constitute an optimal sampling plan in themselves and that a hybrid may be more efficient.},
booktitle = {Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {63-66},
numpages = {4},
location = {Dallas, TX, USA},
series = {SIGGRAPH '90}
}
@inproceedings{10.1145/122718.122735,
author = {Kirk, David and Arvo, James},
title = {Unbiased Sampling Techniques for Image Synthesis},
year = {1991},
isbn = {0897914368},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/122718.122735},
abstract = {We examine a class of adaptive sampling techniques employed in image synthesis and show that those commonly used for efficient anti-aliasing are statistically biased. This bias is dependent upon the image function being sampled as well as the strategy for determining the number of samples to use. It is most prominent in areas of high contrast and is attributable to early stages of sampling systematically favoring one extreme or the other. If the expected outcome of the entire adaptive sampling algorithm is considered, we find that the bias of the early decisions is still present in the final estimator. We propose an alternative strategy for performing adaptive sampling that is unbiased but potentially more costly. We conclude that it may not always be practical to mitigate this source of bias, but as a source of error it should be considered when high accuracy and image fidelity are a central concern.},
booktitle = {Proceedings of the 18th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {153-156},
numpages = {4},
keywords = {statistical bias, adaptive sampling, Monte Carlo, antialiasing},
series = {SIGGRAPH '91}
}
@phdthesis{10.5555/124947,
author = {Shirley, Peter S.},
title = {Physically Based Lighting Calculations for Computer Graphics},
year = {1991},
institution = {University of Illinois at Urbana-Champaign},
address = {USA},
abstract = {Realistic image generation is presented in a theoretical formulation that builds from previous work on the rendering equation. Previous and new solution techniques for the global illumination are discussed in the context of this formulation. The physical rules governing reflection are used to make improvements in local reflection models. The conventional local illumination models used in computer graphics are examined and modified to be consistent with these physical rules.Global illumination is treated in terms of evaluation of a Global Radiance Function. Image-based solution methods are phrased as a lazy evaluation of the Global Radiance Function; evaluation takes place for visible points. Zonal solution methods are phrased as table based solutions. A proof is given that, subject to certain constraints, only O(N) rays are required for a zonal solution with N zones. Simulation allows for surfaces which are not zoned to interact with those that are.The ray tracing zonal solution methods used for surfaces are extended to scenes with participating media. The impact of wavelength selection and time dependencies is also discussed.An object oriented implementation is discussed. This implementation separates the local and global illumination modules, so all of the specifics of the local models are hidden from the global energy transport code. This allows new local modules to be added by specifying the black box access routines.},
note = {UMI Order NO. GAX91-24487}
}
@article{10.1145/226150.226151,
author = {Shirley, Peter S. and Wang, Changyaw and Zimmerman, Kurt},
title = {{M}onte {C}arlo Techniques for Direct Lighting Calculations},
year = {1996},
issue_date = {Jan. 1996},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {15},
number = {1},
issn = {0730-0301},
doi = {10.1145/226150.226151},
abstract = {In a distributed ray tracer, the sampling strategy is the crucial part of the direct lighting calculation. Monte Carlo integration with importance sampling is used to carry out this calculation. Importance sampling involves the design of integrand-specific probability density functions that are used to generate sample points for the numerical quadrature. Probability density functions are presented that aid in the direct lighting calculation from luminaires of various simple shapes. A method for defining a probability density function over a set of luminaires is presented that allows the direct lighting calculation to be carried out with a number of sample points that is independent of the number of luminaires.},
journal = {ACM Trans. Graph.},
month = {1},
pages = {1-36},
numpages = {36},
keywords = {Monte Carlo integration, ray tracing, direct lighting, realistic image synthesis, importance sampling, luminaires}
}
@book{10.1007/978-1-4612-3526-2,
author = {Hall, Roy A.},
publisher = {Springer},
title = {Illumination and Color in Computer Generated Imagery},
year = {1989},
doi = {10.1007/978-1-4612-3526-2},
address = {New York},
series = {Monographs in Visual Communication},
isbn = {978-0-387-96774-5},
keywords = {Computer Graphics, Image Processing and Computer Vision}
}
@book{GLASSNER1995,
author = {Glassner, Andrew S.},
title = {Principles of Digital Image Synthesis},
isbn = {978-0-08-051475-8},
publisher = {Morgan Kaufmann},
address = {San Francisco (CA)},
year = {1995},
series = {The Morgan Kaufmann Series in Computer Graphics},
doi = {10.1016/B978-0-08-051475-8.50009-2},
abstract = {From the Publisher:Image synthesis, or rendering, is a field of transformation: it changes geometry and physics into meaningful images. Because the most popular algorithms frequently change, it is increasingly important for researchers and implementors to have a basic understanding of the principles of image synthesis. Focusing on theory, Andrew Glassner provides a comprehensive explanation of the three core fields of study that come together to form digital image synthesis: the human visual system, digital signal processing, and the interaction of matter and light. Assuming no more than a basic background in calculus, Glassner transforms his passion and expertise into a thorough presentation of each of these disciplines, and their elegant orchestration into modern rendering techniques such as radiosity and ray tracing.}
}
@inproceedings{10.1145/192161.192286,
author = {Ward, Gregory J.},
title = {The RADIANCE Lighting Simulation and Rendering System},
year = {1994},
isbn = {0897916670},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/192161.192286},
abstract = {This paper describes a physically-based rendering system tailored to the demands of lighting design and architecture. The simulation uses a light-backwards ray-tracing method with extensions to efficiently solve the rendering equation under most conditions. This includes specular, diffuse and directional-diffuse reflection and transmission in any combination to any level in any environment, including complicated, curved geometries. The simulation blends deterministic and stochastic ray-tracing techniques to achieve the best balance between speed and accuracy in its local and global illumination methods. Some of the more interesting techniques are outlined, with references to more detailed descriptions elsewhere. Finally, examples are given of successful applications of this free software by others.},
booktitle = {Proceedings of the 21st Annual Conference on Computer Graphics and Interactive Techniques},
pages = {459-472},
numpages = {14},
keywords = {Monte Carlo, physically-based rendering, lighting simulation, ray-tracing, radiosity},
series = {SIGGRAPH '94}
}
@phdthesis{slusallek1996vision,
title = {Vision-an Architecture for Physically-based Rendering: Vision-Eine Architektur F{\"u}r Die Physikalisch-basierte Bildsynthese},
author = {Slusallek, Philipp},
year = {1995},
month = {04},
institution = {University of Erlangen, Inst. f{\"u}r Math. Maschinen und Datenverarbeitung (Informatik), Computer Graphics Group}
}
@inproceedings{10.1145/258734.258914,
author = {Greenberg, Donald P. and Torrance, Kenneth E. and Shirley, Peter and Arvo, James and Lafortune, Eric and Ferwerda, James A. and Walter, Bruce and Trumbore, Ben and Pattanaik, Sumanta and Foo, Sing-Choong},
title = {A Framework for Realistic Image Synthesis},
year = {1997},
isbn = {0897918967},
publisher = {ACM Press/Addison-Wesley Publishing Co.},
address = {USA},
doi = {10.1145/258734.258914},
booktitle = {Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {477-494},
numpages = {18},
keywords = {light reflection, perception, realistic image synthesis},
series = {SIGGRAPH '97}
}
@phdthesis{veach1997robust,
title = {Robust {M}onte {C}arlo methods for light transport simulation},
author = {Veach, Eric},
year = {1997},
month = {12},
school = {Stanford University},
url = {http://graphics.stanford.edu/papers/veach_thesis}
}
@inproceedings{10.1007/978-3-7091-6242-2_26,
author = {Wald, Ingo and Slusallek, Philipp and Benthin, Carsten},
editor = {Gortler, Steven J. and Myszkowski, Karol},
title = {Interactive Distributed Ray Tracing of Highly Complex Models},
booktitle = {Rendering Techniques 2001},
year = {2001},
publisher = {Springer Vienna},
address = {Vienna},
pages = {277-288},
abstract = {Many disciplines must handle the creation, visualization, and manipulation of huge and complex 3D environments. Examples include large structural and mechanical engineering projects dealing with entire cars, ships, buildings, and processing plants. The complexity of such models is usually far beyond the interactive rendering capabilities of todays 3D graphics hardware. Previous approaches relied on costly preprocessing for reducing the number of polygons that need to be rendered per frame but suffered from excessive precomputation times --- often several days or even weeks.},
isbn = {978-3-7091-6242-2}
}
@inproceedings{10.1145/37401.37414,
author = {Cook, Robert L. and Carpenter, Loren and Catmull, Edwin},
title = {The Reyes Image Rendering Architecture},
year = {1987},
isbn = {0897912276},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/37401.37414},
abstract = {An architecture is presented for fast high-quality rendering of complex images. All objects are reduced to common world-space geometric entities called micropolygons, and all of the shading and visibility calculations operate on these micropolygons. Each type of calculation is performed in a coordinate system that is natural for that type of calculation. Micropolygons are created and textured in the local coordinate sysem of the object, with the result that texture filtering is simplified and improved. Visibility is calculated in screen space using stochastic point sampling with a z buffer. There are no clipping or inverse perspective calculations. Geometric and texture locality are exploited to minimize paging and to support models that contain arbitrarily many primitives.},
booktitle = {Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {95-102},
numpages = {8},
series = {SIGGRAPH '87}
}
@article{snow2010terminators,
title = {{T}erminators and {I}ron {M}en: Image-based lighting and physical shading at {ILM}},
author = {Snow, Ben},
journal = {part of “Physically Based Shading Models in Film and Game Production,” SIGGRAPH},
year = {2010}
}
@online{ohmer1997,
title = {Ray Tracers: Blue Sky Studios},
url = {https://www.awn.com/animationworld/ray-tracers-blue-sky-studios},
organization = {Animation World Network},
author = {Ohmer, Susan},
date = {1997-05-01}
}
@inproceedings{10.1145/2776880.2792699,
author = {Keller, A. and Fascione, L. and Fajardo, M. and Georgiev, I. and Christensen, P. and Hanika, J. and Eisenacher, C. and Nichols, G.},
title = {The Path Tracing Revolution in the Movie Industry},
year = {2015},
isbn = {9781450336345},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/2776880.2792699},
abstract = {As path tracing allows for more realistic and faster lighting, an increasing number of movies are created the physically based way. With examples from recent movies, the architectures and novel workflows of the next generation of production renderers are introduced to a wide audience including technical directors, artists, and researchers.},
booktitle = {ACM SIGGRAPH 2015 Courses},
articleno = {24},
numpages = {7},
location = {Los Angeles, California},
series = {SIGGRAPH '15}
}
% 1.8
@inproceedings{10.1145/1468075.1468082,
author = {Appel, Arthur},
title = {Some Techniques for Shading Machine Renderings of Solids},
year = {1968},
isbn = {9781450378970},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/1468075.1468082},
abstract = {Some applications of computer graphics require a vivid illusion of reality. These include the spatial organization of machine parts, conceptual architectural design, simulation of mechanisms, and industrial design. There has been moderate success in the automatic generation of wire frame, cardboard model, polyhedra, and quadric surface line drawings. The capability of the machine to generate vivid sterographic pictures has been demonstrated. There are, however considerable reasons for developing techniques by which line drawings of solids can be shaded, especially the enhancement of the sense of solidity and depth. Figures 1 and 2 illustrate the value of shading and shadow casting in spatial description. In the line drawing there is no clue as to the relative position of the flat plane and the sheet metal console. When shadows are rendered, it is clear that the plane is below and to the rear of the console, and the hollow nature of the sheet metal assembly is emphasized. Shading can specify the tone or color of a surface and the amount of light falling upon that surface from one or more light sources. Shadows when sharply defined tend to suggest another viewpoint and improves surface definition. When controlled, shading can also emphasize particular parts of the drawing. If techniques for the automatic determination of chiaroscuro with good resolution should prove to be competitive with line drawings, and this is a possibility, machine generated photographs might replace line drawings as the principal mode of graphical communication in engineering and architecture.},
booktitle = {Proceedings of the April 30--May 2, 1968, Spring Joint Computer Conference},
pages = {37-45},
numpages = {9},
location = {Atlantic City, New Jersey},
series = {AFIPS '68 (Spring)}
}
@article{doi:10.1177/003754977101600104,
author = {Robert A. Goldstein and Roger Nagel},
title = {3-{D} Visual simulation},
journal = {SIMULATION},
volume = {16},
number = {1},
pages = {25-31},
year = {1971},
doi = {10.1177/003754977101600104},
abstract = {This paper describes a visual simulation technique by which fully computer-generated perspective views of three-dimensional objects may be produced. The method is based on a relatively simple geometric modeling technique for the mathematical representa tion of the three elements essential to the picture- taking process, namely, a camera, a light source, and the object or objects to be photographed. Once these three basic components have been defined, geometric ray tracing is employed to compute a "picture" of the object as it appears in the simu- Zated camera. In essence, individual light rays are traced from their source to the surface of the object. The reflected component of each ray is computed and traced to its point of intersection with the film plane. Thus, each reflected ray pro vides the intensity at a single point on the pic ture, and, when a sufficient number of points have been computed, the entire area of intensity data may be displayed on a cathode ray tube. Several examples of the pictorial output of this process are shown, and the application to the computer- generated films is discussed. }
}
@inproceedings{10.1145/800249.807438,
author = {Kay, Douglas Scott and Greenberg, Donald P.},
title = {Transparency for Computer Synthesized Images},
year = {1979},
isbn = {0897910044},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/800249.807438},
abstract = {Simple transparency algorithms which assume a linear transparency over an entire surface are the type most often employed to produce computer synthesized images of transparent objects with curved surfaces. Although most of the images created with these algorithms do give the impression of transparency, they usually do not look realistic. One of the most serious problems is that the intensity of the light that is transmitted through the objects is generally not proportional to the amount of material through which it must pass. Another problem is that the image seen behind the objects is not distorted as would naturally occur when the light is refracted as it passes through a material of different density.Use of a non-linear transparency algorithm can provide a great improvement in the realism of an image at a small additional cost. Making the transparency proportional to the normal to the surface causes it to decrease towards the edges of the surface where the path of the light through the object is longer. The exact simulation of refraction, however, requires that each sight ray be individually traced from the observer, through the picture plane and through each transparent object until an opaque surface is intersected. Since the direction of the ray would change as each material of differing optical density was entered, the hidden surface calculations required would be very time consuming. However, if a few assumptions are made about the geometry of each object and about the conditions under which they are viewed, a much simplier algorithm can be used to approximate the refractive effect. This method proceeds in a back to front order, mapping the current background image onto the next surface, until all surfaces have been considered.},
booktitle = {Proceedings of the 6th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {158-164},
numpages = {7},
keywords = {Computer graphics, Refraction, Image synthesis, Shading, Transparency},
location = {Chicago, Illinois, USA},
series = {SIGGRAPH '79}
}
@inproceedings{10.1145/37401.37411,
author = {Heckbert, Paul S.},
title = {Ray Tracing {JELL}-{OTM} Brand Gelatin},
year = {1987},
isbn = {0897912276},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/37401.37411},
abstract = {Ray tracing has established itself in recent years as the most general image synthesis algorithm. Researchers have investigated ray-surface intersection calculations for a number of surface primitives, including checkerboards, glass balls, green fractal hills, mandrills, abstract blue surfaces, more glass balls, robot arms, pool balls, low-resolution clouds, morphine molecules, aquatic blobby things making strange noises, fantastic cities, and running skeletons. Unfortunately, nobody has ray traced any food. The Dessert Realism Project here at Pixar is addressing this problem. This paper presents new technology for ray tracing Jell-O® brand gelatin. We believe the method may have application to other brands of gelatin and perhaps pudding as well.},
booktitle = {Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {73-74},
numpages = {2},
series = {SIGGRAPH '87}
}
@book{10.5555/154731,
author = {Cohen, Michael F. and Wallace, John and Hanrahan, Pat},
title = {Radiosity and Realistic Image Synthesis},
year = {1993},
isbn = {0121782700},
publisher = {Academic Press Professional, Inc.},
address = {USA}
}
@book{10.5555/561383,
author = {Sillion, Francois X. and Puech, Claude},
title = {Radiosity and Global Illumination},
year = {1994},
isbn = {1558602771},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA},
abstract = {From the Publisher:The radiosity method, originally a computation tool for thermal engineers, has evolved in recent years into a powerful and flexible simulation technique for radiant energy transfer. The ability to compute quantitatively accurate simulations of light transfers has opened a vast domain of applications for computer graphics. Thermal radiation studies, lighting design and remote sensing are a few of the fields affected by this exciting technique for producing synthetic images. Here, the authors reformulate some of the most recent and innovative research results into a consistent framework, allowing readers to quickly acquire a comprehensive view of the technique and its derivatives. In addition to reviewing practical issues and offering recommendations, the authors also provide a complete theoretical presentation of the various radiosity algorithms.Special highlights include 93 illustrations and 45 color plates and a practical guide which provides detailed information on various design issues for the development of global illumination software.}
}
@book{10.5555/200607,
author = {Ashdown, Ian},
title = {Radiosity: A Programmer's Perspective},
year = {1995},
isbn = {0471304883},
publisher = {John Wiley \& Sons, Inc.},
address = {USA}
}
@inproceedings{Kirk88theray,
author = {David Kirk and James Arvo},
title = {The Ray Tracing Kernel},
booktitle = {In Proceedings of Ausgraph},
year = {1988},
month = {7},
pages = {75-82},
address = {Melbourne, Australia}
}
@book{10.5555/94788,
editor = {Glassner, Andrew S.},
title = {An Introduction to Ray Tracing},
year = {1989},
isbn = {0122861604},
publisher = {Academic Press Ltd.},
address = {GBR}
}
@book{10.5555/940410,
author = {Shirley, Peter S. and Morley, R. Keith},
title = {Realistic Ray Tracing},
year = {2003},
isbn = {1568811985},
publisher = {A. K. Peters, Ltd.},
address = {USA},
edition = {2},
abstract = {From the Publisher:Realistic Ray Tracing is an innovative, in-depth look at the theory and techniques of ray tracing, a method of producing photorealistic computer graphics images by applying simple algorithms. This book will guide you through the steps of creating your own powerful ray tracer program, proceeding from simple images through advanced special effects such as soft shadows, glass and metal textures, and motion blur. It concentrates on the nuts and bolts of writing ray tracing programs, with plenty of practical, detail-oriented how-to advice and careful attention to the underlying theory.}
}
@book{10.5555/1324795,
author = {Suffern, Kevin},
title = {Ray Tracing from the Ground Up},
year = {2007},
isbn = {1568812728},
publisher = {A. K. Peters, Ltd.},
address = {USA}
}
@inproceedings{egtp.19911035,
booktitle = {EG 1991-Technical Papers},
editor = {Werner Purgathofer},
title = {A Testbed for Image Synthesis},
author = {Trumbore, Ben and Lytle, Wayne and Greenberg, Donald P.},
year = {1991},
month = {09},
address = {North-Holland},
publisher = {Eurographics Association},
pages = {467-480},
issn = {1017-4656},
doi = {10.2312/egtp.19911035}
}
@article{4037684,
author = {Hall, Roy A. and Greenberg, Donald P.},
journal = {IEEE Computer Graphics and Applications},
title = {A Testbed for Realistic Image Synthesis},
year = {1983},
volume = {3},
number = {8},
pages = {10-20},
doi = {10.1109/MCG.1983.263292}
}
@book{10.5555/286090,
author = {Larson, Greg Ward and Shakespeare, Rob},
title = {Rendering with Radiance: The Art and Science of Lighting Visualization},
year = {1998},
isbn = {1558604995},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA}
}
@inproceedings{10.1145/325334.325174,
author = {Duff, Tom},
title = {Compositing 3-{D} Rendered Images},
year = {1985},
isbn = {0897911660},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/325334.325174},
abstract = {The complexity of anti-aliased 3-D rendering systems can be controlled by using a tool-building approach like that of the UNIX™ text-processing tools. Such an approach requires a simple picture representation amenable to anti-aliasing that all rendering programs can produce, a compositing algorithm for that representation and a command language to piece together scenes. This paper advocates a representation that combines Porter and Duff's compositing algebra with a Z-buffer to provide simple anti-aliased 3-D compositing.},
booktitle = {Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {41-44},
numpages = {4},
keywords = {anti-aliasing, Z-buffer, image synthesis, compositing, 3-D rendering, hidden-surface elimination},
series = {SIGGRAPH '85}
}
@article{glassner1993spectrum,
title = {Spectrum: An architecture for image synthesis, research, education, and practice},
author = {Glassner, Andrew S.},
editor = {Strauss, Paul S.},
journal = {Developing Large-scale Graphics Software Toolkits,(SIGGRAPH'93 Course Notes 3)},
pages = {1.1-1.44},
year = {1993},
month = {08}
}
@article{468387,
author = {Slusallek, Philipp and Seidel, Hans-Peter},
journal = {IEEE Transactions on Visualization and Computer Graphics},
title = {Vision-an architecture for global illumination calculations},
year = {1995},
volume = {1},
number = {1},
pages = {77-96},
doi = {10.1109/2945.468387}
}
@inproceedings{10.1007/978-3-7091-7484-5_6,
author = {Slusallek, Philipp and Seidel, Hans-Peter},
editor = {Pueyo, Xavier and Schr{\"o}der, Peter},
title = {Towards an Open Rendering Kernel for Image Synthesis},
booktitle = {Rendering Techniques '96},
year = {1996},
publisher = {Springer Vienna},
address = {Vienna},
pages = {51-60},
abstract = {In order to use realistic image synthesis successfully in research and development as well as in commercial products, two important prerequisites have to be fulfilled. First of all, good, accurate, robust, and fast algorithms are required. Impressive progress has been made in this respect during the last years, which has also been documented in this workshop. The second step is the creation of a suitable and general software architecture, that offers an environment into which these rendering algorithms can be integrated.},
isbn = {978-3-7091-7484-5}
}
@book{10.5555/555371,
author = {Apodaca, Anthony A. and Gritz, Larry and Barsky, Brian A.},
title = {Advanced RenderMan: Creating {CGI} for Motion Picture},
year = {1999},
month = {12},
isbn = {1558606181},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA},
edition = {1st},
abstract = {From the Publisher: Introduced by Pixar Studios over a decade ago, the RenderMan Interface Specification is the dominant standard for sending data to the leading rendering programs used by 3D artists and animators. But users are hampered by the lack of authoritative, up-to-date information on applying the standard, having long had to rely on the ten-year-old RenderMan Companion and a far-flung collection of course notes and Web sites. Advanced RenderMan: Beyond the Companion is precisely what RenderMan users are dying for. It offers thoroughly updated coverage while moving beyond the original work's scope to provide in-depth information on dozens of advanced topics. Both a reference and a tutorial, this book will be indispensable to graphics programmers, modelers, animators, technical directors, and hobbyists-it is truly the key to their ability to achieve state-of-the-art 3D effects. Key Features: Written by the world's foremost RenderMan experts-key figures at Pixar, the company that developed and first implemented the standard Offers advanced users instruction not available anywhere else while providing a leg up to relative beginners-including tips on avoiding mistakes and an appendix covering key math skills. Filled with technical illustrations and many full-color representations of effects supported by the RenderMan standard Via a companion Web site, provides comprehensive documentation of the standard's semantics and syntax, example source code, shaders and other software, and the full set of SIGGRAPH course notes on RenderMan}
}
@article{doi:10.1080/10867651.1996.10487462,
author = {Larry Gritz and James K. Hahn},
title = {{BMRT}: A Global Illumination Implementation of the RenderMan Standard},
journal = {Journal of Graphics Tools},
volume = {1},
number = {3},
pages = {29-47},
year = {1996},
publisher = {Taylor \& Francis},
doi = {10.1080/10867651.1996.10487462}
}
@inproceedings{732097,
author = {Sung, K. and Craighead, J. and Changyaw Wang and Bakshi, S. and Pearce, A. and Woo, A.},
booktitle = {Proceedings Pacific Graphics '98. Sixth Pacific Conference on Computer Graphics and Applications (Cat. No.98EX208)},
title = {Design and implementation of the Maya Renderer},
year = {1998},
pages = {150-159},
doi = {10.1109/PCCGA.1998.732097}
}
@book{10.5555/863712,
author = {Driemeyer, Thomas and Herken, Rolf},
title = {Programming Mental Ray},
year = {2003},
isbn = {3211838511},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
edition = {2}
}
@inproceedings{4061561,
author = {Bigler, James and Stephens, Abe and Parker, Steven G.},
booktitle = {2006 IEEE Symposium on Interactive Ray Tracing},
title = {Design for Parallel Interactive Ray Tracing Systems},
year = {2006},
volume = {},
number = {},
pages = {187-196},
doi = {10.1109/RT.2006.280230}
}
@misc{acton_2014,
title = {Data-Oriented Design and {C}++},
url = {https://www.slideshare.net/cellperformance/data-oriented-design-and-c},
journal = {SlideShare},
author = {Acton, Mike},
year = {2014},
month = {9}
}
% 2.9
@incollection{SHOEMAKE1991351,
title = {VII.6 - Quaternions and 4x4 matrices},
editor = {James Arvo},
booktitle = {Graphics Gems II},
publisher = {Morgan Kaufmann},
address = {San Diego},
pages = {351-354},
year = {1991},
isbn = {978-0-08-050754-5},
doi = {10.1016/B978-0-08-050754-5.50074-8},
author = {Ken Shoemake},
abstract = {Publisher Summary
This chapter describes the quaternions and 4 x 4 matrices. Quaternions are steadily replacing Euler angles as the internal representation of orientations. They mesh remarkably well with 4 × 4 homogeneous matrices. Matrix multiplication can be used quite nicely for quaternion multiplication, because quaternions are, in fact, four-component homogeneous coordinates for orientations, and because they multiply linearly. A quaternion q as a 4-vector, written as (xq, yq, zq, wq), or as just (x, y, z, w) is described. Some systems do not implement matrix manipulations carefully, and will misbehave if the bottom right entry of the matrix is not 1. Even when normalization is desired, it is not necessary to compute a square root and only addition, subtraction, multiplication, and division are used. It is found that only the last row and column of the two matrices differ, and then only by transposition or sign change.}
}
@inproceedings{10.1145/325334.325242,
author = {Shoemake, Ken},
title = {Animating Rotation with Quaternion Curves},
year = {1985},
isbn = {0897911660},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
doi = {10.1145/325334.325242},
abstract = {Solid bodies roll and tumble through space. In computer animation, so do cameras. The rotations of these objects are best described using a four coordinate system, quaternions, as is shown in this paper. Of all quaternions, those on the unit sphere are most suitable for animation, but the question of how to construct curves on spheres has not been much explored. This paper gives one answer by presenting a new kind of spline curve, created on a sphere, suitable for smoothly in-betweening (i.e. interpolating) sequences of arbitrary rotations. Both theory and experiment show that the motion generated is smooth and natural, without quirks found in earlier methods.},
booktitle = {Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques},
pages = {245-254},
numpages = {10},
keywords = {spherical geometry, B\'{e}zier curve, in-betweening, spline, rotation, B-spline, interpolation, animation, quaternion, approximation},
series = {SIGGRAPH '85}
}
@misc{Blow_2004,
title = {Understanding Slerp, Then Not Using It},
url = {http://number-none.com/product/Understanding%20Slerp,%20Then%20Not%20Using%20It/},
journal = {Happycake Development Notes},
author = {Blow, Jonathan},
year = {2004},
month = {2}
}
@inproceedings{10.5555/155294.155324,
author = {Shoemake, Ken and Duff, Tom},
title = {Matrix Animation and Polar Decomposition},
year = {1992},
isbn = {0969533810},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA},
booktitle = {Proceedings of the Conference on Graphics Interface '92},
pages = {258-264},
numpages = {7},
keywords = {Polar decomposition, matrix animation, greedy algorithm, homogeneous matrix, spectral decomposition, QR decomposition, matrix decomposition, singular value decomposition, interpolation, rotation},
location = {Vancouver, British Columbia, Canada}
}
@article{doi:10.1137/0907079,
author = {Higham, Nicholas J.},
title = {Computing the Polar Decomposition-with Applications},
journal = {SIAM Journal on Scientific and Statistical Computing},
volume = {7},
number = {4},
pages = {1160-1174},
year = {1986},
doi = {10.1137/0907079}
}
% 2.11
@article{10.1145/282957.282969,
author = {Goldman, Ronald N.},
title = {Illicit Expressions in Vector Algebra},
year = {1985},
issue_date = {July 1985},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {4},
number = {3},
issn = {0730-0301},
doi = {10.1145/282957.282969},
abstract = {In vector geometry there are 2 distinct types of entities: points P, Q, R … and vectors u, v, w … Generally, the operattions of vector algebra —addition, subtraction, scalar multiplication, dot product, and cross product—are intrinsically defined only for vectors, not for points. Yet illicit expressions containing terms like P + Q, cP, P X Q, etc. often appear in graphics textbooks, papers, and programs. In this paper we justify the use of such illicit expressions, and we we give criteria for recognizing when such an expression is truly legitimate. In particular we show that an algebraic expression E (P1, …, Pn) is legitimate if and only if E(v1 + w, …vn + w) = E(v1, …, vn) + kw, k + 0, 1. We also derive many useful examples of such an expression.},
journal = {ACM Trans. Graph.},
month = {7},
pages = {223-243},
numpages = {21},
keywords = {vector geometry, vector algebra}
}
@inproceedings{10.1007/978-3-642-61542-9_19,
author = {DeRose, Tony D.},
editor = {Stra{\ss}er, Wolfgang and Seidel, Hans-Peter},
title = {A Coordinate-Free Approach to Geometric Programming},
booktitle = {Theory and Practice of Geometric Modeling},
year = {1989},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
pages = {291-305},
abstract = {In this paper it is shown that traditional (coordinate-based) approaches to geometric programming lead to programs that are geometrically ambiguous, and potentially geometrically invalid. To combat these deficiencies, a geometric algebra and an associated coordinate-free abstract data type are outlined. The algebra and the abstract data type are founded on two basic principles: affine/Euclidean geometry and coordinate-freedom.},
isbn = {978-3-642-61542-9}
}
@techreport{Mann97acoordinate,
author = {Stephen Mann and Nathan Litke and Tony Derose},
title = {A Coordinate Free Geometry {ADT}},
institution = {CS-97-15, Computer Science Department, University of Waterloo},
year = {1997}
}
@book{10.5555/2821579,
author = {Schneider, Philip and Eberly, David H.},
title = {Geometric Tools for Computer Graphics},
year = {2002},
isbn = {9780080478029},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA},
abstract = {Do you spend too much time creating the building blocks of your graphics applications or finding and correcting errors Geometric Tools for Computer Graphics is an extensive, conveniently organized collection of proven solutions to fundamental problems that you'd rather not solve over and over again, including building primitives, distance calculation, approximation, containment, decomposition, intersection determination, separation, and more. If you have a mathematics degree, this book will save you time and trouble. If you don't, it will help you achieve things you may feel are out of your reach. Inside, each problem is clearly stated and diagrammed, and the fully detailed solutions are presented in easy-to-understand pseudocode. You also get the mathematics and geometry background needed to make optimal use of the solutions, as well as an abundance of reference material contained in a series of appendices. Features Filled with robust, thoroughly tested solutions that will save you time and help you avoid costly errors. Covers problems relevant for both 2D and 3D graphics programming. Presents each problem and solution in stand-alone form allowing you the option of reading only those entries that matter to you. Provides the math and geometry background you need to understand the solutions and put them to work. Clearly diagrams each problem and presents solutions in easy-to-understand pseudocode. Resources associated with the book are available at the companion Web site www.mkp.com/gtcg. * Filled with robust, thoroughly tested solutions that will save you time and help you avoid costly errors. * Covers problems relevant for both 2D and 3D graphics programming. * Presents each problem and solution in stand-alone form allowing you the option of reading only those entries that matter to you. * Provides the math and geometry background you need to understand the solutions and put them to work. * Clearly diagrams each problem and presents solutions in easy-to-understand pseudocode. * Resources associated with the book are available at the companion Web site www.mkp.com/gtcg. Table of Contents Preface 1. Introduction 2. Matrices and Linear Systems 3. Vector Algebra 4. Matrices, Vector Algebra, and Transformations 5. Geometric Primitives in 2D 6. Distance in 2D 7. Intersection in 2D 8. Miscellaneous 2D Problems 9. Geometric Primitives in 3D 10. Distance in 3D 11. Intersection in 3D 12. Miscellaneous 3D Problems 13. Computational Geometry Topics A. Numerical Methods B. Trigonometry C. Basic Formulas For Geometric Primitives Bibliography}
}
@book{10.5555/63448,
author = {Rogers, D. F. and Adams, J. A.},
title = {Mathematical Elements for Computer Graphics},
edition = {2},
year = {1990},
isbn = {0070535299},
publisher = {McGraw-Hill, Inc.},
address = {New York, USA}
}
@book{10.5555/113163,
author = {Stolfi, Jorge},
title = {Oriented Projective Geometry},
year = {1991},
isbn = {0126720258},
publisher = {Academic Press Professional, Inc.},
address = {San Diego, USA}
}
@book{lang2012introduction,
title = {Introduction to Linear Algebra},
author = {Lang, Serge},
series = {Undergraduate Texts in Mathematics},
year = {1986},
edition = {2},
doi = {10.1007/978-1-4612-1070-2},
publisher = {Springer Science \& Business Media}
}
@book{buck1956advanced,
title = {Advanced Calculus},
author = {Buck, Robert Creighton},
year = {1978},
address = {New York, USA},
publisher = {McGraw-Hill}
}
@book{10.1201/9781315365459,
author = {Tomas Akenine-Möller, Eric Haines, Naty Hoffman},
publisher = {A. K. Peters/CRC Press},
title = {Real-Time Rendering},
year = {2008},
edition = {3},
pages = {1045},
address = {New York, USA},
isbn = {978-1-56881-424-7},
doi = {10.1201/9781315365459}
}
@inproceedings{inproceedings,
author = {Wallis, Bob},
year = {1990},
month = {08},
pages = {533-538},
title = {Forms, Vectors, And Transforms},
isbn = {9780080507538},
journal = {Graphics Gems},
doi = {10.1016/B978-0-08-050753-8.50117-0}
}
@incollection{TURKOWSKI1990539,
title = {Properties of surface-normal transformations},
editor = {Andrew S. Glassner},
booktitle = {Graphics Gems},
publisher = {Morgan Kaufmann},
address = {San Diego},
pages = {539-547},
year = {1990},
isbn = {978-0-08-050753-8},
doi = {10.1016/B978-0-08-050753-8.50118-2},
author = {Ken Turkowski}
}
@incollection{SHOEMAKE1994207,
title = {III.4. - Polar Matrix Decomposition},
editor = {Paul S. Heckbert},
booktitle = {Graphics Gems},
publisher = {Academic Press},
pages = {207-221},
year = {1994},
isbn = {978-0-12-336156-1},
doi = {10.1016/B978-0-12-336156-1.50029-X},
author = {Ken Shoemake}
}
@inbook{10.5555/180895.180914,
author = {Shoemake, Ken},
title = {{E}uler Angle Conversion},
year = {1994},
isbn = {0123361559},
publisher = {Academic Press Professional, Inc.},
address = {USA},
booktitle = {Graphics Gems IV},
pages = {222-229},
numpages = {8}
}
@inproceedings{Bloom2003ErrorsAO,
title = {Errors and Omissions in {M}arc {A}lexa's "Linear Combination of Transformations"},
author = {C. Bloom and J. Blow and Casey Muratori},
year = {2003},
url = {http://pds16.egloos.com/pds/201003/31/85/Errors_and_Omissions_in_Marc_Alexa_s_Linear_Combination_of_Transformations.pdf}
}
@article{doi:10.1080/2151237X.2011.610255,