计算机图形学：算法与实现(英文影印版)

.1.7.1 implementation 26
1.7.2 program description 29
1.8 summary 32
1.9 review questions and exercises 32
2 two-dimensional geometric transformations 33--113
2.1 prologue 33
2.2 tp. anslation 34
2.2.1 implementation 35
2.2.2 program description 45
2.3 reflection 57
2.3.1 implementation 58
2.3.2 program description 61
2.4 rotation 66
2.4.1 implementation 67
2.4.2 program description 71
2.5 scaling 76
2.5.1 implementation 76
2.5.2 program description 81
2.6 zooming 85
2.6.1 implementation 87
2.6.2 program description 91
2.7 rubber banding 97
2.7.1 implementation 97
2.7.2 program description 106
2.8 summary 113
2.9 review questions and exercises 113
3 line drawing algorithms
3.1 prologue 114
3.2 scm conversion algorithm: a simple line drawing algorithm 115
3.3 bresenham's scm conversion algorithm 116
3.3.1 implementation 119
3.3.2 program description 131
3.4 bar chart 146
3.4.1 implementation 148
3.4.2 program description 156
3.5 summary 166
3.6 review questions and exercises 166
4 circle drawing algorithms
4.1 prologue 167
4.2 bresenham's circle drawing algorrmm 168
4.2.1 implementation 171
4.2.2 program description 178
4.3 bresenham's ellipse drawing algorithm 184
4.3.1 implementation 187
4.3.2 program description 194
4.4 arc 198
4.4.1 implementation 200
4.4.2 program description 206
4.5 pie chart 209
4.5.1 implementation 210
4.5.2 program description 218
4.6 projected pie implementation 225
4.6.1 program description 234
4.7 summary 236
4.8 review questions and exercises 237
5 drawing curves
5.1 prologue 238
5.2 b-spline curve 239
5.2.1 implementation 240
5.2.2 program description 247
5.3 bezier curve 252
5.3.1 implementation 253
5.3.2 program description 264
5.4 summary 272
5.5 review questions arm exercises 272
6 filling algorithms
6.1 prologue 273
6.2 seed fill algorithm 274
6.2.1 implementation 284
6.2.2 program description 296
6.3 scan line polygon fill algorithm 307
6.3.1 implementation 311
6.3.2 program description 321
6.4 summary 343
6.5 review questions and exercises 343
7 clipping algorithms
7.1 prologue 344
7.2 viewport clipping 344
7.2.1 implementation 346
7.2.2 program description 360
7.3 mn)point subdivision line clipping 380
7.3.1 implementation 381
7.3.2 program description 384
7.4 sutherland-cohen line clipping 392
7.4.1 implementation 394
7.4.2 program description 397
7.5 summary 405
7.6 review questions ant) exercises 405
8 three-dimensional graphics
8.1 prologue 406
8.2 3d coordinate system 406
8.3 displaying 3d objects 409
8.4 3d transformations 410
8.4.1 3d translation 410
8.4.2 3d rotation 410
8.4.3 3d scaling 411
8.5 3d object to 2d image projection 411
8.5.1 worm coordinate to 3d viewpoint-based coordinate
transformation 412
8.5.2 viewpoint-based coordinate system to 2d image transformation 415
8.6 displaying cube in 2d screen 416
8.6.1 implementation 416
8.6.2 program description 429
8.7 displaying sphere in 2d screen 443
8.7.1 implementation 443
8.7.2 program description 446
8.8 viewing transformations 448
8.9 implementation of other geometric shapes 451
8.9.1 implementation 451
8.9.2 program description 478
8.10 summary 504
8.11 review questions and exercises 505
9 hidden surface removal
9.1 prologue 506
9.2 z-buffer 507
9.3 z-buffer algorithm for cube 508
9.3.1 implementation 508
9.3.2 program description 516
9.4 z-buffer algorithm for sphere 526
9.4.1 implementation 526
9.4.2 program description 528
9.5 ray tracing 529
9.6 ray tracing algorithm for cube 533
9.6.1 implementation 533
9.6.2 program description 538
9.7 ray tracing algorithm for sphere 543
9.7.1 implementation 543
9.7.2 program description 546
9.8 summary 547
9.9 review questions and exercises 547
10 illumination and shading
10.1 prologue 549
10.2 illumination 550
10.3 modelling a shiny surface 552
10.3.1 phong illumination model 552
10.4 phong illumination for cube 555
10.4.1 implementation 555
10.5 phong illumination for sphere 571
10.5.1 implementation 571
10.5.2 program description 573
10.6 summary 574
10.7 review questions and exercises 575
suggested further reading
index