交互式计算机图形学--基于OpenGL的自顶向下方法(第四版)(英文影印版)

1.6.2 Three-Dimensional APb 24
1.6.3 ASequence of Images 26
1.6.4 The Modeling-Rendering Paradigm 28
1.7 Graphics Architectures
1.7.1 Display Processors 29
1.7.2 Pipeline Architectures 30
1.7.3 The Graphics Pipeline 31
1.7.4 Vertex Processing 31
1.7.5 Clipping and Primitive Assembly 32
1.7.6 Rasterization 33
1.7.7 Fragment Processing 33
1.8 Programmable Pipelines
1.9 Performance Characteristics
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 2 GRAPHICS PROGRAMMING
2.1 The Sierpinski Gasket
2.2 Programming Two-Dimensional Applications
2.2.1 Coordinate Systems 45
2.3 The OpenGL APl
2.3.1 Graphics Functions 47
2.3.2 The Graphics Pipeline and State Machines 48
2.3.3 The OpenGL Interface 49
2.4 Primitives and Attributes
2.4.1 Polygon Basics 52
2.4.2 Polygon Typesin OpenGL 53
2.4.3 Approximatinga 5phere 55
2.4.4 Text 56
2.4.5 Curved Objects 58
2.4.6 Attributes 58
2.5 Color
2.5.1 RGB Color 62
2.5.2 Indexed Color 64
2.5.3 Setting of Color Attributes 65
2.6 Viewing
2.6.1 The Orthographic View 67
2.6.2 Two-Dimensional Viewing 69
2.6.3 Matrix Modes 70
2.7 Control Functions
2.7.1 Interaction with the Window System 71
2.7.2 Aspect Ratio and Viewports 73
2.7.3 The main. display. and myinit Functions 74
2.7.4 Program Structure 76
2.8 The Gasket Program
2.9 Polygons and Recursion
2.10 The Three-Dimensional Gasket
2.10.1 Use of Three-Dimensional Points 80
2.10.2 Use of Polygons in Three Dimensions 82
2.10.3 Hidden-Surface Removal 84
2.11 Plotting Implicit Functions
2.11.1 Marching Squares 86
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 3 INPUT AND INTERACTION
3.1 Interaction
3.2 Input Devices
3.2.1 Physical Ilnput Devices 107
3.2.2 Logical Devices 104
3.2.3 Input Modes 105
3.3 Clients and Servers
3.4 Display Lists
3.4.1 Definition and Execution of Display Lists 110
3.4.2 Text and Display Lists 112
3.4.3 Fonts in GLUT 114
3.5 Programming Event-Driven Input
3.5.1 Using the Pointing Device 116
3.5.2 Window Events 119
3.5.3 Keyboard Events 121
3.5.4 The Display and Idle Callbacks 121
3.5.5 Window Management 122
3.6 Menus
3.7 Picking
3.7.1 Picking and Selection Mode 125
3.8 A Simple Paint Program
3.9 Building Interactive Models
3.10 Animating Interactive Programs
3.10.1 The Rotating Square 140
3.10.2 Double Buffering 142
3.10.3 Using a Timer 144
3.11 Design of Interactive Programs
3.11.1 Toolkits. Widgets. and the Frame Buffer 145
3.12 Logic Operations
3.12.1 Drawing Erasable Lines 147
3.12.2 XORand Color 150
3.12.3 Cursors and Overlay Planes 151
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 4 GEOMETRIC OBJECTS AND
TRANSFORMATIONS
4.1 Scalars. Points. and Vectors
4.1.1 Geometric Objects 158
4.1.2 Coordinate-Free Geometry 159
4.1.3 The Mathematical View: Vector and Affine Spaces 160
4.1.4 The Computer Science View 161
4.1.5 Geometric ADTs 162
4.1.6 Lines 162
4.1.7 Affine Sums 163
4.1.8 Convexity 164
4.1.9 Dot and Cross Products 164
4.1.10 Planes 165
4.2 Three-Dimensional Primitives
4.3 Coordinate Systems and Frames
4.3.1 Representations and N-Tuples 170
4.3.2 Change of Coordinate Systems 171
4.3.3 Example Change of Representation 173
4.3.4 Homogeneous Coordinates 174
4.3.5 Example Change in Frames 177
4.3.6 Working with Representations 179
4.4 Frames in OpenGL
4.5 Modeling a Colored Cube
4.5.1 Modeling the Faces 185
4.5.2 Inward- and Outward-Pointing Faces 186
4.5.3 Data Structures for Object Representation 187
4.5.4 The Color Cube 187
4.5.5 Bilinear Interpolation 189
4.5.6 Vertex Arrays 190
4.6 Affine Transformations
4.7 Translation. Rotation. and Scaling
4.7.1 Translation 195
4.7.2 Rotation 196
4.7.3 Scaling 197
4.8 Transformations in Homogeneous Coordinates
4.8.1 Translation 200
4.8.2 Scaling 201
4.8.3 Rotation 202
4.8.4 Shear 203
4.g Concatenation of Transformations
4.9.1 Rotation Abouta Fixed Point 205
4.9.2 General Rotation 207
4.9.3 The Instance Transformation 208
4.9.4 Rotation About an Arbitrary Axis 209
4.10 OpenGL Transformation Matrices
4.10.1 The Current Transformation Hatrix 213
4.10.2 Rotation. Translation. and Scaling 214
4.10.3 Rotation About a Fixed Pointin OpenGL 214
4.10.4 Order of Transformations 215
4.10.5 Spinning of the Cube 216
4.10.6 Loading. Pushing. and Popping Hatrices 217
4.11 Interfaces to Three-Dimensional Applications
4.11.1 Using Areas of the Screen 218
4.11.2 AVirtuaITrackball 219
4.11.3 Smooth Rotations 222
4.11.4 Incremental Rotation 223
4.12 quaternions
4.12.1 Complex Numbersand Quaternions 224
4.12.2 quaternionsand Rotation 225
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 5 VIEWING
5.1 Classical and Computer Viewing
5.1.1 Classical Viewing 235
5.1.2 Orthographic Projections 236
5.1.3 Axonometric Projections 237
5.1.4 Oblique ProJections 238
5.1.5 Perspective Viewing 239
5.2 Viewing with a Computer
5.3 Positioning of the Camera
5.3.1 Positioning of the Camera Frame 242
5.3.2 Two Viewing APIs 247
5.3.3 The Look-At Function 250
5.3.4 Other Viewing APIs 251
5.4 Simple Projections
5.4.1 Perspective Projections 252
5.4.2 Orthogonal Projections 255
5.5 Projections in OpenGL
5.5.1 Perspective in OpenGL 257
5.5.2 Parallel Viewing in OpenGL 258
5.6 Hidden-Surface Removal
5.6.1 Culling 262
5.7 Interactive Mesh Displays
5.7.1 Meshes 262
5.7.2 Walking Through a Scene 264
5.7.3 Polygon Offset 266
5.8 Parallel-Projection Matrices
5.8.1 Projection Normalization 268
5.8.2 Orthogonal-Projection Hatrices 268
5.8.3 Oblique Projections 271
5.9 Perspective-Projection Matrices
5.9.1 Perspective Normalization 274
5.9.2 OpenGL Perspective Transformations 278
5.10 Projections and Shadows
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 6 SHADING
6.1 Light and Hatter
6.2 Light Sources
6.2.1 Color Sources 290
6.2.2 Ambient Light 290
6.2.3 Point Sources 291
6.2.4 Spotlights 292
6.2.5 Distant Light Sources 292
6.3 The Phong Reflection Model
6.3.1 Ambient Reflection 295
6.3.2 Diffuse Reflection 295
6.3.3 Specular Reflection 297
6.3.4 The Modified Phong Model 298
6.4 Computation of Vectors
6.4.1 Normal Vectors 300
6.4.2 Angle of Reflection 302
6.5 Polygonal Shading
6.5.1 Flat Shading 304
6.5.2 Smooth and Gouraud Shading 306
6.5.3 Phong Shading 308
6.6 Approximation of a Sphere by Recursive Subdivision
6.7 Light Sources in OpenGL
6.8 Specification of Materials in OpenGL
6.9 Shading of the Sphere Model
6.10 Global Illumination
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 7 FROM VERTICES TO FRAGMENTS
7.1 Basic Implementation Strategies
7.2 Four Major Tasks
7.2.1 Modeling 326
7.2.2 Geometry Processing 327
7.2.3 Rasterization 328
7.2.4 Fragment Processing 329
7.3 Clipping
7.4 Line-Segment Clipping
7.4.1 Cohen-Sutherland Clipping 331
7.4.2 Liang-Barsky Clipping 333
7.5 Polygon Clipping
7.6 Clipping of Other Primitives
7.6.1 Bounding Boxes and Volumes 338
7.6.2 Curves. Surfaces. and Text 339
7.6.3 Clipping in the Frame Buffer 340
7.7 Clipping in Three Dimensions
7.8 Rasterization
7.9 Bresenham's Algorithm
7.10 Polygon Rasterization
7.10.1 Inside-Outside Testing 348
7.10.2 OpenGLand Concave Polygons 350
7.10.3 Fill and Sort 351
7.10.4 Flood Fill 351
7.10.5 Singularities 352
7.11 Hidden-Surface Removal
7.11.1 Object-Space and Image-Space Approaches 353
7.11.2 Sorting and Hidden-Surface Removal 354
7.11.3 Scanline Algorithms 355..
7.11.4 Back-Face Removal 356
7.11.5 The z-Buffer Algorithm 357
7.11.6 Scan Conversion with thez-Buffer 359
7.11.7 Depth Sort and the Painter'sAIgorithm 361
7.12 Antialiasing
7.13 Display Considerations
7.13.1 Color Systems 366
7.13.2 The Color Matrix 369
7.13.3 Gamma Correction 370
7.13.4 Dithering and Halftoning 371
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 8 DISCRETE TECHNIQUES
8.1 Buffers
8.2 Digital Images
8.3 Writing into Buffers
8.3.1 Writing Modes 385
8.3.2 Writing with XOR 387
8.4 Bit and Pixel Operations in OpenGL
8.4.1 OpenGL Buffers and the Pixel Pipeline 389
8.4.2 Bitmaps 390
8.4.3 Raster Fonts 391
8.4.4 Pixels and Images 393
8.4.5 Lookup Tables 394
8.5 Examples
8.5.1 The MandelbrotSet 395
8.5.2 Testing Algorithms 398
8.5.3 Buffers for Picking 399
8.6 Happing Methods
8.7 Texture Mapping
8.7.1 Two-Dimensional Texture Happing 402
8.8 Texture Mapping in OpenGL
8.8.1 Two-Dimensional Texture Mapping 409
8.8.2 Texture Sampling 412
8.8.3 Working with Texture Coordinates 415
8.8.4 Texture Objects 417
8.8.5 Multitexturing 418
8.9 Texture Generation
8.10 Environment Maps
8.11 Compositing Techniques
8.11.1 Opacity and Blending 425
8.11.2 Image Compositing 426
8.11.3 Blending and Compositingin OpenGL 427
8.11.4 Antialiasing Revisited 428
8.11.5 Back-to-Front and Front-to-Back Rendering 430
8.11.6 Depth Cueing and Fog 431
8.12 Multirendering and the Accumulation Buffer
8.12.1 Scene Antialiasing 433
8.12.2 Bump Mapping and Embossing 433
8.12.3 Image Processing 434
8.12.4 Imaging Extensions 435
8.12.5 Other Multipass Methods 436
8.13 Sampling and Aliasing
8.13.1 Sampling Theory 437
8.13.2 Reconstruction 442
8.13.3 Quantization 444
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 9 PROGRAMMABLE SHADERS
9.1 Programmable Pipelines
9.2 Shading Languages
9.2.1 Shade Trees 451
9.3 Extending OpenGL
9.3.1 OpenGL Versions and Extensions 453
9.3.2 GLSL and Cg 454
9.4 The OpenGL Shading Language
9.4.t Vertex Shaders 454
9.4.2 Fragment Shaders 457
9.5 The OpenGL Shading Language
9.5.1 GLSL Execution 458
9.5.2 Data Types and Qualifiers 459
9.5.3 Operators and Functions 462
9.6 Linking Shaders with OpenGL Programs
9.7 Moving Vertices
9.7.1 Scaling Vertex Positions 465
9.7.2 Morphing 467
9.7.3 Particle Systems 468
9.8 Lighting with Shaders
9.8.1 Phong Shading 470
9.8.2 Nonphotorealistic Shading 473
9.9 Fragment Shaders
9.10 Per-Vertex Versus Per-Fragment Phong Shading
9.11 Samplers
9.12 Cube Maps
9.12.1 Reflection Haps 480
9.12.2 Refraction 482
9.12.3 Normalization Haps 485
9.13 Bump Mapping
9.13.1 Finding Bump Maps 487
9.13.2 Bump Mapping with Height Fields 489
9.13.3 Bump Mapping with Fragment Shaders 490
9.13.4 Example 490
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
cHAPTER 10 MODELING
10.1 Symbols and Instances
10.2 Hierarchical Models
10.3 A Robot Arm
10.4 Trees and Traversal
10.4.1 A Stack-Based Traversal 505
10.5 Use of Tree Data Structures
10.6 Animation
10.7 Graphical Objects
10.7.1 Methods. Attributes. and Messages 514
10.72 A Cube Object 516
10.7.3 Implementing the Cube Object 518
10.7.4 Objects and Hierarchy 519
10.7.5 Geometric Objects 520
10.8 Scene Graphs
10.9 A Simple Scene Graph API
10.9.1 The Node Class 523
10.9.2 Geometry Nodes 525
10.9.3 Camera Class 527
10.9.4 Lights and Materials 528
10.9.5 Transformations 529
10.9.6 The Robot Figure 530
10.9.7 Implementing the Viewer 532
10.9.8 Implementing a Node 536
10.10 Other Tree Structures
10.10.1 CSG Trees 539
10.10.2 BSP Trees 541
10.10.3 Quadtreesand Octrees 543
10.11 Graphics and the Internet
10.11.1 Networks and Protocols 545
10.11.2 Hypermedia and HTML 546
10.11.3 Databases and VRHL 547
10.11.4 Java and Applets 548
10.12 Procedural Methods
10.13 Physically Based Models and Particle Systems
10.14 Newtonian Particles
10.14.1 Independent Particles 554
10.14.2 Spring Forces 554
10.14.3 Attractive and Repulsive Forces 556
10.15 Solving Particle Systems
10.16 Constraints
10.16.1 Collisions 560
10.16.2 Soft Constraints 563
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 11 CURVES AND SURFACES
11.1 Representation of Curves and Surfaces
11.1.1 Explicit Representation 569
11.1.2 Implicit Representations 571
11.1.3 Parametric Form 572
11.1.4 Parametric Polynomial Curves 573
11.1.5 Parametric PolynomialSurfaces 574
11.2 Design Criteria
11.3 Parametric Cubic Polynomial Curves
11.4 Interpolation
11.4.1 Blending Functions 579
11.4.2 The Cubic Interpolating Patch 581
11.5 Hermite Curves and Surfaces
11.5.1 The Hermite Form 583
11.5.2 Geometric and Parametric Continuity 585
11.b Bezier Curves and Surfaces
11.6.1 Bezier Curves 586
11.6.2 Bezier Surface Patches 589
11.7 Cubic B-Splines
11.7.1 TheCubic B-Spline Curve 591
11.7.2 B-Splines and Basis 594
11.7.3 Spline Surfaces 595
11.8 General B-Splines
11.8.1 Recursively Defined B-Splines 597
11.8.2 Uniform Splines 598
11.8.3 Nonuniform B-Splines 599
11.8.4 NURB5 599
11.9 Rendering of Curves and Surfaces
11.9.1 Polynomial Evaluation Methods 601
11.92 RecursiveSubdivision of Bezier Polynomials 602
11.9.3 Rendering of Other Polynomial Curves by Subdivision 605
11.9.4 Subdivision of Bezier Surfaces 605
11.10 The Utah Teapot
11.11 Algebraic Surfaces
11.11.1 Quadrics 610
11.11.2 Rendering of Surfaces by Ray Casting 611
11.11.3 Subdivision Curves and Surfaces 611
11.11.4 Mesh Subdivision 612
11.12 . Curves and Surfaces in OpenGL
11.12.1 Bezier Curves 616
11.12.2 BGzier Surfaces 617
11.12.3 Displaying the Teapot 618
11.12.4 NURBS Functions 6210
11.12.5 Quadrics 620
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
CHAPTER 12 ADVANCED RENDERING
12.1 Going Beyond Pipeline Rendering
12.2 Ray Tracing
12.3 Building a Simple Ray Tracer
12.3.1 Recursive Ray Tracing 630
12.3.2 Calculating Intersections 632
12.3.3 Ray-Tracing Variations 635
12.4 The Rendering Equation
12.5 Radiosity
12.5.1 The Radiosity Equation 639
12.5.2 Solving the Radiosity Equation 640
12.5.3 Computing Form Factors 642
12.5.4 Carrying Out Radiosity 644
12.6 RenderMan
12.7 Large-Scale Rendering
12.7.1 Sort-Middle Rendering 648
12.7.2 Sort-Last Rendering 650
12.7.3 Sort-First Rendering 653
12.8 Image-Based Rendering
12.8.1 ASimple Example 655
SUMMARY AND NOTES
SUGGESTED READINGS
EXERCISES
APPENDIX A SAMPLE PROGRAMS
A.1 Sierpinski Gasket Program
A.2 Recursive Generation of Sierpinski Gasket
A.3 Recursive Three-Dimensional Sierpinski Gasket
A.4 Marching Squares
A.5 Square Drawing Program
A.6 Paint Program
A.7 Double-Buffering Example
A.8 Selection-Mode Picking Program
A.9 Rotating-Cube Program
A.10 Rotating Cube Using Vertex Arrays
A.11 Rotating Cube with a Virtual Trackball
A.12 Moving Viewer
A.13 Sphere Program
A.14 Mandelbrot Set Program
A.15 Bresenham's Algorithm
A.16 Rotating Cube with Texture
A.17 GLSL Example
A.18 Scene-Graph Example
A.19 Program for Drawing Bezier Curves
APPENDIX B 5PACES
B.1 Scalars
B.2 Vector Spaces
B.3 Affine Spaces
B.4 Euclidean Spaces
B.5 Projections
B.6 Gram-Schmidt Orthogonalization
SUGGESTED READINGS
EXERCISES
APPENDIX C MATRICES
C.1 Definitions
C.2 Matrix Operations
C.3 Row and Column Matrices
C.4 Rank
C.5 Change of Representation
C.6 The Cross Product
C.7 Eigenvalues and Eigenvectors
SUGGESTED READINGS
EXERCISE5
APPENDIX D SYNOPSIS OF OPENGL FUNCTIONS
D.1 Specifying Simple Geometry
D.2 Attributes
D.3 Working with the Window System
D.4 Interaction
D.5 Enabling Features
D.6 Transformations
D.7 Viewing
D.8 Defining Discrete Primitives
D.9 Display Lists
D.10 Picking
D.11 Lighting
D.12 Texture Mapping
D.13 State and Buffer Manipulation
D.14 Vertex Arrays
D.15 Blending Functions
D.16 Query Functions
D.17 Curve and Surface Functions
D.18 GLU Quadrics
D.19 GLSL Functions
References 763
Function Index 771
Subject Index 773...

.　　The reaction of readers of the first three editions of this book was overwhelmingly positive, especially to the use of OpenGL and the top-down approach. But there are always improvements to be made and recent advances to be covered. The advent of programmable graphics processors has been a major advance, one that I believe should have a major impact on how we teach computer graphics. Besides forcing a rearrangement of material from earlier editions, techniques that were not possible to implement in most systems, and thus were covered only in a perfunctory manner, are now routine and can be taught in a first course in computer graphics. An additional benefit of the rearrangement of topics is that the chapters now follow the OpenGL pipeline more closely than in previous editions.
　　Programmable shaders are covered in the new Chapter 9 using the OpenGL Shading Language that is part of OpenGL 2.0. Using programmable shaders, many techniques now can be implemented in real time. Hence, some of the material has been moved around. Thus, bump mapping, which was covered with texture mapping in the third edition, is now covered with fragment shaders. Although some instructors may find this change to be a bit odd at first, I think that they will sce the advantages when they start tcaching about vertex and fragment shaders.
　　I have eliminated the separate chapters on scientific visualization and proccdural methods from the third edition. Except for the most advanced sections, most of the material has been distributed through the other chapters in a way that should allow instructors to cover some advanced material at their option. For example, the marching squares method is now at the end of Chapter 2 to provide an example of a sophisticated two-dimensional application, but coveting it is not necessary for proceeding to Chapter 3.
　　I believe that these changes should have minor effects on the teaching of a one-semester introductory course but should make it easier for instructors to use the book for a two-semester class.
　　Support Materials
　　The support for thc book is on the Web, both through the author's Web site www. cs. unm.edu/-angel and Addison-Wesley's site www. aw. com/cssupport. Support material that is availablc to all readers of this book includes
　　Sources of information on OpenGL.
　　Instructions on how to get started with OpenGL on the most popular systems.
　　Program code.
　　Solutions to selected exercises.
　　PowerPoint lectures.
　　Additional support materials, including solutions to all the nonprogramming exercises, are available only to instructors adopting this textbook for classroom use. Please contact your school's Addison-Wesley representative for information on obtaining access to this material.
　　Acknowledgments
　　I have been fortunate over the past few years to have worked with wonderful students at UNM. They were the first to get me interested in OpenGL, and I have learned much from them. They include Hue Bumgarner-Kirby (Walker), Ye Cong, Pat Crossno, Tommie Daniel, Chris Davis, Lisa Desjarlais, Kim Edlund, Lee Ann Fisk, Maria Gallegos, Brian Jones, Christopher Jordan, Max Hazelrigg, Sheryl Hurley, Thomas Keller, Ge Li, Pat McCormick, Al McPherson, Ken Moreland, Martin Muller, David Munich, Jim Pinkerton, Jim Prewett, Dave Rogers, Hal Smyer, Takeshi Hakamata, Dave Vick, Brian Wylie, and Jin Xiong. Many of the examples in the color plates were created by these students.
　　The first edition of this book was written during my sabbatical; various parts were written in five different countries. The experience speaks well for the versatility of portable computers and the universality of the Internet. Nevertheless,the task would not have been accomplished without the help of a number of people and institutions that made their facilities available to me. I am greatly indebted to Jonas Montilva and Chris Birkbeck of the Universidad de los Andes (Venezuela), to Rodrigo Gallegos and Aristides Novoa of the Universidad Tecnologica Equinoccial (Ecuador), to Long Wen Chang of the National Tsing Hua University (Taiwan), and to Kin Hong Wong and Phcng Ann Heng of the Chinese University of Hong Kong. Ramiro Jordan of ISTEC and the University of New Mexico made possible many of these visits. John Brayer and Jason Stewart at the University of New Mexico and Helen Goldstein at Addison-Wesley somehow managed to get a variety of items to me wherever I happened to be. My Web site contains a description of my adventures writing the first edition.
　　This edition was written in New Mexico and benefited greatly from the feedback of hundreds of instructors and students who used these editions and sent me their comments. Many of the changes from earlier editions are responses to their requests and comments.
　　David Kirk and Mark Kilgard at NVIDIA were kind enough to provide cards for testing many of the recent algorithms. A number of other people provided significant help. I thank Ben Bederson, Gonzalo Cartagenova, Tom Caudell, Kathi Collins, Kathleen Danielson, Roger Ehrich, Robert Geist, Chuck Hansen, Mark Henne, Bernard Moret, Dick Nordhaus, Helena Saona, Dave Shreiner, Vicki Shreincr, Gwen Sylvan, and Mason Woo. Mark Kilgard, Brian Paul, and Nate Robins arc owed a great debt by the OpenGL community for creating software that enables OpenGL code to be developed over a variety of platforms.
　　At the University of New Mexico, the High Performance Computing Center and IBM provided support for many of my visualization projects. The Compurer Science Department, the Arts Technology Center in the College of Fine...