computer graphics assignment pdf

Introduction to Computer Graphics

(3 reviews)

David J. Eck, Hobart and William Smith Colleges

Copyright Year: 2016

Publisher: David J. Eck

Language: English

Formats Available

Conditions of use.

Learn more about reviews.

Reviewed by Marietta Cameron, Associate Professor, University of North Carolina Asheville on 2/1/18

The author intentionally and most understandably designed this text to present material for a one semester undergraduate course. Thus the topic coverage is a subset of material typically presented in texts addressing computer graphics. I... read more

Comprehensiveness rating: 3 see less

The author intentionally and most understandably designed this text to present material for a one semester undergraduate course. Thus the topic coverage is a subset of material typically presented in texts addressing computer graphics. I appreciate the implementations in Java, C, and JavaScript. Since the OpenSource 3D animation software Blender with its python interface is presented, maybe later editions of this text will include implementations in python. The hyperlinked terms and the demos embedded in the text’s online version enhance student learning. I respectfully disagree with the author’s decision to present foundational concepts with the much older OpenGL 1.1 and glut when he could do the same with OpenGL 4.5( or later) and freeglut. I also think that students would find chapter exercises helpful.

Content Accuracy rating: 4

This book's content is accurate with a few typos.

Relevance/Longevity rating: 2

As I have already mentioned, I strongly suggest the author drop all references to OpenGL 1.1 except in a section on the history of OpenGL. I agree that geometric modeling, transformations, color, lighting, textures, animation are fundamental but students (and industry) seem to ignore academics who present any ideas with what they (students and industry experts) perceive as outdated technologies.

Clarity rating: 5

The text is as clear as its "commercially available" counterparts.

Consistency rating: 4

The text is mostly consistent in terms of terminology and framework. A minor complaint is the occasional tense switch between first person singular and first person plural.

Modularity rating: 4

The text is written with an approach in mind....the topics can be rearranged with moderate effort.

Organization/Structure/Flow rating: 5

The organization is understandable, logical, and clear.

Interface rating: 3

It would be helpful if all figures and demos were numbered and labeled. Maybe later editions could include interactive exercises that would assess student understanding.

Grammatical Errors rating: 5

A few typos but nothing glaring.

Cultural Relevance rating: 3

This text avoids cultural references. Maybe it could offer more references to graphical software, games, animations, and special interest groups such as ACM SIGGRAPH, SIGCHI, and IGDA (International Game Developers Association).

I would include this text as a supplemental resource to for my students.

Reviewed by Jong Kwan Lee, Associate Professor, Bowling Green State University on 2/1/18

The contents of the book cover many topics in computer graphics that should be enough for an introductory level computer graphics course. However, some contents might need a little more explanation (e.g., Bezier curves) and I would like it to... read more

Comprehensiveness rating: 4 see less

The contents of the book cover many topics in computer graphics that should be enough for an introductory level computer graphics course. However, some contents might need a little more explanation (e.g., Bezier curves) and I would like it to include a coverage in clipping algorithms.

Content Accuracy rating: 5

The contents of the book seem very accurate. There are a variety of computer graphics topics covered, some more in details than others, with simple examples and interactive demos and these seem to be accurate.

Relevance/Longevity rating: 4

The book primary covers the basics in computer graphics. While some contents are not the most up-to-date materials, they are very adequate for introductory level computer graphics courses. I would personally use a different platform than Java in a computer graphics course, but the contents can be adapted to others.

Clarity rating: 4

Most of the contents are clear and adequate for a computer graphics textbook. However, there are a couple of topics that I would have like it to cover more in depth so that it might be easier for students to understand the topics.

Consistency rating: 5

The author presented the contents very consistently. The same approach is used to explain various computer graphics topics.

Modularity rating: 5

The took is easily and readily divisible into smaller reading sections. For example, I would cover some subsections from different chapters with other subsections and the book contents seem to be modular to do so.

Organization/Structure/Flow rating: 4

In general, I like the organization so that the contents are introduced in a logical way. However, there were a couple of sub-topics that could be combined with other sub-topics if I were to teach a computer graphics course with the book.

Interface rating: 5

There was no interface issue I could find. Links and demos that I checked all work properly.

No grammar mistake was found.

Cultural Relevance rating: 5

I don't think this question is related to the contents of the book. But the book had no issue for the point.

The book covers both 2D and 3D computer graphics topics with examples and demos. It should be a good textbook for an introductory level computer graphics book.

Reviewed by Brian Barsky, Professor of Computer Science, University of California, Berkeley on 2/1/18

This book is a guide for how write graphics programs using OpenGL and WebGL. It does not provide a an explanation of the concepts, methods, mathematics, physics algorithms, science, psychology, etc., etc., that one would find in a standard... read more

Comprehensiveness rating: 1 see less

This book is a guide for how write graphics programs using OpenGL and WebGL. It does not provide a an explanation of the concepts, methods, mathematics, physics algorithms, science, psychology, etc., etc., that one would find in a standard graphics text book, such as the ones by Foley et al., Shirley, Hearn & Baker, etc., etc.

Relevance/Longevity rating: 5

That is fine

That is fine.

Seemed fine.

no problems (and not a relevant question)

I would like to reiterate my overarching concern that this book is a guide for how write graphics programs using OpenGL and WebGL and does not provide a an explanation of the concepts, methods, mathematics, physics algorithms, science, psychology, etc., etc., that one would find in a standard graphics text book, such as the ones by Foley et al., Shirley, Hearn & Baker, etc., etc. As such, it is reminiscent of the Open GL Programming Guide by Mason Woo, Jackie Neider, Tom Davis, and Dave Shreiner. This would be a useful adjunct to a real computer graphics text book, such as the ones by Foley et al., Hearn & Baker, or Shirley but would not provide a suitable replacement for a real computer graphics textbook like that.

Table of Contents

• Chapter 1: Introduction
• Chapter 2: Two-Dimensional Graphics
• Chapter 3: OpenGL 1.1: Geometry
• Chapter 4: OpenGL 1.1: Light and Material
• Chapter 5: Three.js: A 3D Scene Graph API
• Chapter 6: Introduction to WebGL
• Chapter 7: 3D Graphics with WebGL
• Chapter 8: Beyond Realtime Graphics
• Appendix A: Programming Languages
• Appendix B: Blender: A 3D Modeling Program
• Appendix C: Gimp and Inkscape for 2D Graphics
• Appendix D: Source Code for Sample Programs
• Appendix E: Glossary

Ancillary Material

• David J. Eck

About the Book

Introduction to Computer Graphics is a free, on-line textbook covering the fundamentals of computer graphics and computer graphics programming. This book is meant for use as a textbook in a one-semester course that would typically be taken by undergraduate computer science majors in their third or fourth year of college.

About the Contributors

David J. Eck Ph.D. is a Professor at Department of Mathematics and Computer Science at the Hobart and William Smith Colleges.

Contribute to this Page

This class is over. It was taught in a previous semester.

Csci 420 computer graphics, spring 2020.

Introduction and Purpose

This course is an introduction to three-dimensional computer graphics. Students will learn both the theory of 3D computer graphics, and how to program it efficiently using OpenGL . The course primarily teaches the "modern" shader-based OpenGL (core profile) , but also introduces the "classic" fixed-function OpenGL (compatibility profile). Topics include 2D and 3D transformations, Bézier and B-Spline curves for geometric modeling, interactive 3D graphics programming, computer animation and kinematics, and computer graphics rendering including ray tracing, shading and lighting. There will be an emphasis on the mathematical and geometric aspects of computer graphics. This course is regularly offered every semester (the instructor may vary from offering to offering, as may the content somewhat). instruction (by instructor), and 1 hour of recitation (by the TA or producer) weekly. -->

Annoucements

There are currently no announcements.

Schedule | Prerequisites | Textbooks | Assignments | Grading | Resources and Supplementary Reading | Academic Integrity

Prerequisites

• Junior, senior, MS or PhD student, or explicit permission of instructor
• CSCI 104 (Data Structures and Object-Oriented Design)
• MATH 225 (Linear Algebra and Differential Equations)
• Familiarity with calculus and linear algebra
• C/C++ programming skills

Textbooks (both strongly recommended)

• Edward Angel: Interactive Computer Graphics: A Top-Down Approach Using OpenGL, Sixth edition, Publisher: Addison Wesley, ISBN: 9780321535863
• Dave Shreiner: OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 4.3 , Eighth edition, Publisher: Addison-Wesley Professional, ISBN: 9780321773036

Assignments

There will be three programming homework assignments, teaching students OpenGL and how to program 3D computer graphics. Please see the schedule for links to assignments and due dates. All assignments must be done individually.

Assignments: 17% each (51% total)

Mid-term exam: 19%

Final exam: 30%

All assignments must be completed to pass the course. Students must take the mid-term and final exams to pass the course. The assignments will have a small amount of extra credit.

Late policy: Programming assignments should be turned in by midnight on the day they are due. A total of three late days may be taken during the semester on programming assignments. For example, you can use one late day on the second assignment, and two on the third assignment. All days are counted, including any weekends and holidays, as follows: Less than 24 hours late = 1 late day, 24-48 hours late = 2 late days, 48-72 hours late = 3 late days, and so on. The flexibility provided by the late days is intended to get you through the time where all your classes just happen to have assignments due on the same day. Beyond the three late days, there will be a penalty of 10% of the value of the assignment / day. Exceptions will be granted only under most dire circumstances and must be discussed with and approved by the instructor at least one week in advance. Assignment and exam grading may be discussed within three weeks of them being returned to the students.

There is a forum on Piazza where students can ask questions.

Resources and Supplementary Readings

Academic integrity.

All students are expected to maintain the utmost level of academic integrity. Do not copy any parts of any of the assignments from anyone. Do not look at other students' code, papers, assignments or exams. The university policies on academic conduct will be applied rigorously, and the USC Office of Student Judicial Affairs and Community Standards will be notified.

Academic Conduct Plagiarism - presenting someone else's ideas as your own, either verbatim or recast in your own words, is a serious academic offense with serious consequences. Please familiarize yourself with the discussion of plagiarism in SCampus in Section 11, Behavior Violating University Standards, https://scampus.usc.edu/1100-behavior-violating-university-standards-and-appropriate-sanctions/. Other forms of academic dishonesty are equally unacceptable. See additional information in SCampus and university policies on scientific misconduct, http://policy.usc.edu/scientific-misconduct/.

Discrimination, sexual assault, and harassment are not tolerated by the university. You are encouraged to report any incidents to the Office of Equity and Diversity http://equity.usc.edu/ or to the Department of Public Safety http://capsnet.usc.edu/department/department-public-safety/online-forms/contact-us. This is important for the safety whole USC community. Another member of the university community -- such as a friend, classmate, advisor, or faculty member -- can help initiate the report, or can initiate the report on behalf of another person. The Center for Women and Men http://www.usc.edu/student-affairs/cwm/ provides 24/7 confidential support, and the sexual assault resource center webpage [email protected] describes reporting options and other resources.

Support Systems A number of USC's schools provide support for students who need help with scholarly writing. Check with your advisor or program staff to find out more. Students whose primary language is not English should check with the American Language Institute http://dornsife.usc.edu/ali, which sponsors courses and workshops specifically for international graduate students. The Office of Disability Services and Programs http://sait.usc.edu/academicsupport/centerprograms/dsp/home_index.html provides certification for students with disabilities and helps arrange the relevant accommodations. If an officially declared emergency makes travel to campus infeasible, USC Emergency Information http://emergency.usc.edu/will provide safety and other updates, including ways in which instruction will be continued by means of blackboard, teleconferencing, and other technology.

Statement for Students with Disabilities

Any student requesting academic accommodations based on a disability is required to register with Disability Services and Programs (DSP) each semester. A letter of verification for approved accommodations can be obtained from DSP. Please be sure the letter is delivered to me (or to TA) as early in the semester as possible. DSP is located in STU 301 and is open 8:30 a.m.–5:00 p.m., Monday through Friday. The phone number for DSP is (213) 740-0776.

I wish to thank Prof. Frank Pfenning and Prof. Jessica Hodgins from Carnegie Mellon University for generously providing materials from their computer graphics courses at CMU. This course has also been influenced by computer graphics courses at Cornell, MIT and UC Berkeley.

COS 426: Computer Graphics

Spring 2020.

• Description

Computer graphics is the intersection of computer science, geometry, physics, and art. This course will study topics in this broad and remarkable field, with an emphasis on practical methods and applications. In particular, the course will provide an extensive introduction to image processing, modeling, rendering, and computer animation. The goal of this course is to equip students with the various tools and techniques they need to build large projects with significant graphical components; this includes applications for realizing artistic visions (art and architecture), user interaction (UI/UX development), entertainment products (video games, CGI, animations, and augmented reality), visualizations and academic research (physics, biology, chemistry, engineering, and other disciplines), etc.

Topics include: color theory, sampling, image processing, image compositing, mesh representations, mesh processing, parametric curves and surfaces, implicit surfaces, subdivision surfaces, geometric data structures, geometric transformations, ray casting, lighting and reflectance, global illumination, rasterization, scan conversion, particle systems, animation, computer games, fabrication, etc.

• Prerequisites

The course is appropriate for students who have taken COS 217 and COS 226 (or equivalent). JavaScript will be the main programming language; however no prior knowledge of the language is required for students who wish to enroll in this course.

• Lectures and Precepts

Lectures are held on Tuesdays and Thursdays from 3:00–4:20PM over Zoom.

Precept is held on Wednesday and Thursday from 7:30–8:20PM in Friend Center 008. Students may attend either (or both) during any week, regardless of their registration. In general, precept attendance is highly encouraged.

• Required Reading

There is one required textbook for this course:

Computer Graphics with OpenGL , 4th Ed., Hearn, Baker, and Carithers. Prentice Hall, 2010. ISBN: 978-0136053583.

In the past, most students have found it is possible to pass the course without opening the textbook once, as almost all graded material is provided through lecture and precepts; nevertheless, this textbook will prove extremely useful for especially eager and motivated students who wish to pursue further studies in computer graphics. In addition to covering graphics concepts that could not otherwise squeeze into this course, the textbook contains wonderful C++ and OpenGL implementations that all graphics programmers would be well-suited to know.

Staff contact information is listed below, but students seeking help should keep in mind that it is almost always more appropriate to post their question to Piazza rather than emailing an individual member of the course staff.

Felix Heide

• Office Hours

Tuesday after class

Graduate TA

Darby Haller

Tuesday 1–2pm

Ethan Tseng

Monday 4–5pm

Yuting Yang

Monday 3–4pm

Undergraduate TA

Friday 11am–12pm, Saturday 12–2pm, and Sunday 2–3pm

Daniel Chae

Friday 1–3pm, and Saturday 2–3pm

June Ho Park

Sunday 1–3pm, as well as Precept Problem Sessions

Lucas Salvador

Friday 12–2pm

Phillip Yoon

Friday 2–4pm, and Sunday 9–11pm

Reilly Bova

Sunday 2–4pm, as well as Precept Problem Sessions

William Sweeny

Friday 11am–1pm, and Sunday 3–5pm, as well as Precept Problem Sessions

The precepts for this class follow the “flipped classroom” methodology and serve to assist students with their assignments. During the first 10–15 minutes of precept, instructors briefly review precept materials with the entire class; these precept materials generally consist of “tips and tricks” slides for current assignment. It is highly recommended that students read through an assignment’s precept slides (in their entirety) before starting work on the assignment itself.

Following review, the precept then turns into a problem session , during which instructors are available as LabTAs to answer students’ questions individually and to provide personal assignment troubleshooting.

• Expectations

COS 426 is a 400-level class. For students concentrating in Computer Science, this course will be marked as a senior departmental on their transcript. Accordingly, students should not only expect to be held to higher standards, but should also expect less hand-holding in general than they may find in 300-level courses and below.

In particular, students should not expect LabTAs to give them the answer to an assignment problem after enough pestering. Course staff are available to help students with their learning, not their grade. Here is a list of what instructors can help with:

Course staff are happy to help explain course concepts or general techniques that students may be confused about.

• e.g. “Could you please explain image convolution?”

Course staff are happy to clarify assignment specs, provided the clarification is not about an intentional ambiguity.

• e.g. “Should this filter rotate the image clockwise or counterclockwise?”

Course staff are happy to give the occasional starting hint (but no more) to put students on the right track for a certain problem.

• e.g. “The runtime of the brush filter should not exceed 4r^2 per center.”

Course staff are happy to answer questions about JavaScript syntax.

• e.g. “How can I iterate over entries in an Object?”
• Course staff will give modest debugging assistance only once students have demonstrated that they understand the solution to a problem at a high level (in other words, after students explain what they are trying to do, and that explanation is correct).

Unless a student has a JavaScript syntax question, instructors will not look at any code until the student has demonstrated that they understand the solution to the problem they need help with (see the last bullet point above). Second, unless it’s a syntax issue, instructors will not fix a student’s code for them. They will simply state what region of the code looks wrong. Also, if a student’s explanation is incorrect, instructors will not fix it for them. Course staff will either state what part of it is wrong, and / or ask a question to give the student something to think about.

Undergraduate LabTAs are available to help students during both precepts. LabTAs are also available in the Friend Fishbowl room Friday 11am–4pm, Saturday 12–3pm, and Sunday 1–5pm & 9–11pm.

Graduate course staff are available over Zoom from 3–5pm on Mondays, and 1–2pm on Tuesdays. Professor Heide’s office hours are held Tuesday after class in the Zoom lecture meeting.

• Course Grades

Final grades are based on six biweekly programming assignments (60%), one written exam (15%), a final programming project (20%), and course participation (5%). Throughout the semester, there will ample opportunities for extra credit and student participation. In particular, students are highly encouraged both to enter each assignment art contest, as well as to engage regularly with their peers on Piazza .

• Written Exam

Only one exam is administered during this course. Currently, this exam is scheduled to be taken in-class on the Thursday of midterms week. The exam is closed-book; however, students are permitted to each bring an 8.5x11” double-sided cheat-sheet . The written exam covers all course material up through (and including) Week 5. Students may be tested on any and all graphics concepts touched on through lectures, readings, and assignments during this period. Examples of exams from previous offerings of this course will be posted; however, note that past exams may have covered different material. Students may also find the qualitative exercises available on the course website helpful when preparing for the exam, but they should expect more quantitative questions on the exam itself.

Although the six weeks of course material that follow the exam are not covered on any written test, it is still “tested” through strict no-collaboration questions that are introduced into assignment writeups following Spring Recess. Effectively, these questions will serve as a second “take-home” exam spread throughout the later assignments. This is done in order alleviate the dependency of students’ final grades on their sole written exam grade, while also testing material without overburdening students with tedious and stressful examinations. Note that the grades for no-collaboration questions are incorporated into assignment grades rather than into exam grades.

• Programming Assignments

There are six biweekly programming assignments. Assignments are not weighted evenly. Assignments will be implemented mostly in JavaScript. Any computer and browser may be used for development, however students should ensure that their programs work on Chrome with the latest release of macOS, as this is the environment in which submissions are tested and graded.

Assignments are submitted via the Princeton CS Dropbox, also known as TigerFile. Students should look for the submission link in the description of each assignment, login with their Princeton netID, and then submit all applicable files by the posted deadline. Students may resubmit and unsubmit files as needed up until the submission deadline. Further alterations will result in the assignment being marked as late.

When submitting an assignment, all code, writeup, input images, output images, overlay images, etc., should be packed into a single folder titled “assignmentN” (where N is the assignment number — eg. , assignment0) and compressed. In the interest of preserving space, it is requested that all images are submitted in .jpg format.

• Final Project

The final project is a chance for students to build a system incorporating one or more idea that has been learned in class. Projects should be done in groups of two or three (other team sizes are permitted with permission of an instructor). The focus of the project can be anything of the group’s choosing, as long as it somehow involves computer graphics. Many students choose to create games, or art demos, but it really can be anything.

Students are welcome to recycle code infrastructure provided for previous assignments, and they are also permitted to borrow ideas or other code infrastructure from the web or elsewhere. However, teams should be very careful to distinguish which parts they contributed to directly, and which other parts are loaned from elsewhere. Moreover, while it is ok to use common libraries/infrastructure, they should not dwarf students’ own code in terms of their role in the project. In particular, if a hypothetical group were to make a game, they should not build on top of a highly polished and complete game engine like Unity.

• Late Policy

Assignments are due at 11:55PM on their posted due dates, where submission time is determined by the file date of the file upload. Following a very brief grace period (which students should confirm with an instructor beforehand), one minute late is the same as one day late. Note that if any part of an assignment is submitted late, the entire assignment will be marked late. To submit an assignment late, remove all uploads from the online submission system, since instructors will grade partial submissions as-is (whereas no submissions are marked late). Note that work cannot be accepted after Dean’s Date without a Dean’s recommendation.

Late assignments are marked down 1/4 of the full grade per day or partial day late. This said, students may elect to wave up to three days of late penalties. Additional late penalties will be waived only in the case of unforeseeable circumstances like medical emergencies, as documented by a student’s Dean or Director of Studies. Note that late days cannot be used for the final project as it is due on Dean’s Date

Students who feel they have been incorrectly graded may write a short private Piazza post describing the potential grading mistake. All regrade requests must be posted within two weeks of when the potential grading error was made.

• Collaboration Policy

Programming is an individual creative process much like composition. Students must reach their own understanding of the problem and discover a path to its solution. During this time, discussions among students in this course about the assignments is not only permitted but encouraged . Moreover, those who find they benefit from bouncing ideas off of their peers are encouraged to work in pairs .

Note that this is somewhat more relaxed than the collaboration policies of COS 126, COS 226, COS 217, etc., in the sense the conceptual components (ideation, brain-storming, understanding, problem-solving) of all assignments are partnered, even though programming components of assignments are still individual. This relaxed policy does not mean pairs are allowed share all their code with one another. Here is an executive summary:

• Individual Solutions

Students must individually compose all of their own solutions. The term solutions refers to any of the products created when completing a programming assignment excluding the writeup file, such as source code (including comments), a personal understanding of all submitted work, and output images. It includes both finished and unfinished products, regardless of correctness or completeness.

• Students must never share their code with anyone (besides their current partner) who is taking COS 426 now or who might take COS 426 in the future. Note that sharing output artwork with others is not only permitted but encouraged, so long as doing so does not expose solution specifics.
• Students must never receive or view someone else’s solutions to a programming assignment (or variant of an assignment), besides that of their current partner.
• Students must never view someone else’s writeup, including that of their current partner.

All the rules above continue to apply after assignments are graded and after the end of the semester.

• Collaboration with Course Staff

Students are welcome to discuss their solutions with course staff members during the precept problem sessions, in office hours, and via private Piazza posts.

• Collaboration with Partners

Students may show their partial or complete solution to another student, and they may examine their solutions. However, all submitted code must be fully understood and more specifically typed into the computer by student submitting the assignment. If a student sees and understands another student’s solution (perhaps because they are working as a pair) then they should take a minute to think about it and then type their own version of the solution.

For each assignment, students must specifically state in their writeup file the names of any individuals with whom they collaborated, or from whom they received help, and the nature of the help that they received. This includes help from friends, the internet, classmates, and course staff members, among others.

• Collaboration with Classmates

Students are encouraged to discuss common concerns with classmates either in private or publicly in the Piazza course forum. These discussions must be kept at a general level, without exposing their solutions.

• Concerning Electronic Communication

If a student has a question or comment that will be helpful to other students, and they need not reveal any parts of their work to express the question or comment properly, then they should post it to the course’s Piazza page. One of the course’s instructors will reply as soon as possible. Instructors also welcome replies from other students and may “endorse” a student’s response instead of composing an instructor’s response.

If a student has a question or comment that will not be helpful to other students, or if they must reveal parts of their work to express their question or comment adequately, then they should post it privately on Piazza .

Students should not, under any circumstances, share code in digital form!

Please do not publish solutions to programming assignments in a way that could compromise their utility as pedagogical tools. For example, do not make them available on a publicly accessible web page, such as GitHub. At Princeton, this is a violation of the basic Rights, Rules, Responsibilities of members of the University community.

Plagiarism and abetting plagiarism are serious academic infractions. Programming is a creative work and the academic regulations that apply to plagiarizing prose also apply to plagiarizing code. Princeton’s Rights, Rules, Responsibilities defines plagiarism as “the use of any outside source without proper acknowledgment.” It ranges from “verbatim copying” (e.g., cutting-and-pasting code) to “thorough paraphrasing” (e.g., changing variable names or rearranging code).

• Copying from a Partner

The more lenient collaboration policy for this course is a privilege; it is founded in the trust between students and instructors. If students are caught breaking this trust by violating the collaboration policy, they risk having this policy revoked for the entire class.

• Outside Sources & Citations

Students are only permitted to copy or adapt that is not theirs if it comes from the course materials (i.e., the course textbook, programming assignment specifications, lecture slides, precept slides, etc.). When students use outside sources, they must cite any code that they copy or adapt (with the exception of code that is included in the assignment starter files).

• Plagiarism Penalties

We refer alleged academic violations (including plagiarism and abetting plagiarism) to the Committee on Discipline . If found responsible, the typical penalty is an F as a course grade plus whatever penalty that the CoD imposes. (The typical CoD penalty for plagiarism is suspension from the University for one year.) Violators of course policies that are not adjudicated by the CoD will receive penalties based on the severity of the violation, ranging from a warning (for violations that are both unintentional and innocuous) to an F in the course (for violations that are both intentional and serious).

• Acknowledgements

The COS 426 course staff would like to thank former COS 426 undergraduate and two-time TA Reilly Bova ’20 for creating this beautiful website and revising all the assignment specifications. We would also like to thank William Sweeney ’20 and Reilly Bova together for rewriting the precept slides and compiling supplementary content for the course.

Assignments and Grading

• Homework Schedule : Weekly homeworks are assigned Tuesday and due the following Monday.
• Evaluation : Grades will be 50% homeworks, 50% final project (ray traced image). The weekly graded homeworks are designed as building blocks towards the final ray traced image. There will be 8 homeworks, and they each count equally. For samples of student final projects from previous years, see the project showcase page .
• Collaboration : You may work with a partner for both the homeworks and the final ray traced image. You may change partners as often as you wish throughout the quarter. It is recommended but not required that you attend the grading sessions with your partner, if applicable. However, the CAs will ask independent questions -- the person being asked the question by the CA should answer.
• Rubric : Assignments will be graded on a 0-5 point basis. The rubric will be provided at the end of each homework's writeup. If your homework grades are not going well, then do not be surprised if your final image grade is lower than what you expect. Feedback is very important in computer graphics, so please take each homework seriously and attend the grading sessions each week.
• Late Assignments : As a general rule, no late assignments will be accepted . Exceptions will of course be made for unforeseeable circumstances and as required by university or departmental policy.

Hardware and Software

You are encouraged to do class assignments on your personal computer. Computers should contain a modern graphics card with at least 2 GB of free disk space to download and run Blender. Blender is readily available on Windows, Mac, and Linux platforms, and the starter code has been tested on all of these platforms.

Computer Graphics (CS602)

Handouts (pdf) / Powerpoint Slides (PPTs)

• Lessons (1-45) (pdf format)
• Power Point Slides (1-42,45)

Handouts / Power Point Slides

Acc, bif, bio, bit, bnk, bt ....

• ACC311 - Lessons (1-45) (pdf format)
• ACC501 - Lessons (1-45) (pdf format)
• BIF401 - Lessons (pdf Format)
• BIF602 - Lessons (pdf Format)
• BIF604 - Lessons (pdf Format)
• BIO101 - Lessons (pdf Format)
• BIO102 - Lessons (1-21) (pdf Format)
• BIO301 - Lessons (1-167) (pdf Format)
• BIO503 - Lessons (pdf Format)
• BIT701 - Lessons (1-45) (pdf Format)
• BIT701 - Power Point Slides (1-45)
• BIT703 - Lessons (1-45) (pdf Format)
• BIT703 - Power Point Slides (1-45)
• BIT710 - Lessons (1-45) (pdf Format)
• BIT710 - Power Point Slides (1-45)
• BIT715 - Lessons (1-45) (pdf Format)
• BIT715 - Power Point Slides (1)
• BNK601 - Lessons (1-45) (pdf format)
• BNK603 - Lessons (1-45) (pdf format)
• BNK604 - Lessons (1-45) (pdf format)
• BNK604 - Power Point Slides (1-45)
• BT403 - Lessons (pdf Format)
• BT405 - Lessons (pdf Format)
• BT733 - Lessons (pdf Format)
• CS001 - Lessons (1-45) (pdf format) (CPL Book)
• CS101 - Fundamentals of Computer (Notes - 16 Chapters)
• CS101 - Lessons (1-45) (Old, pdf format)
• CS101 - Power Point Slides (1-45)
• CS101 - Handouts (New, pdf format)
• CS201 - Lessons (1-45) (pdf format)
• CS201 - Power Point Slides (1-45)
• CS204 - Slides (1 - 15) (pdf Format)
• CS301 - Lessons (1-45) (pdf format)
• CS301 - Power Point Slides (1-45)
• CS302 - Lessons (1-45) (pdf format)
• CS302 - Power Point Slides (1-45)
• CS304 - Lessons (1-45) (pdf format)
• CS304 - Power Point Slides (1-45)
• CS401 - Lessons (Handouts) (pdf format)
• CS401 - Power Point Slides (1-45)
• CS402 - Lessons (1-45) (pdf format)
• CS402 - Power Point Slides (1-45)
• CS403 - Lessons (1-45) (pdf format)
• CS403 - Power Point Slides (1-45)
• CS408 - Lessons (1-45) (pdf format)
• CS408 - Power Point Slides (2-9, 11-20, 22-30, 32-45)
• CS410 - Lessons (1-30) (pdf format)
• CS410 - Power Point Slides (1-30)
• CS501 - Lessons (1-45) (pdf format)
• CS501 - Power Point Slides (1-45)
• CS502 - Lessons (pdf format)
• CS502 - Power Point Slides (1-11)
• CS502 - Power Point Slides (12-22)
• CS502 - Power Point Slides (23-33)
• CS502 - Power Point Slides (34-45)
• CS504 - Lessons (1-45) (pdf format)
• CS504 - Notes (12 Chapters)
• CS504 - Power Point Slides (1-15)
• CS504 - Power Point Slides (16-25)
• CS504 - Power Point Slides (26-32)
• CS504 - Power Point Slides (33-40)
• CS504 - Power Point Slides (41-45)
• CS506 - Lessons (1-45) (pdf format)
• CS506 - Power Point Slides (1-45) (29 is missing)
• CS507 - Lessons (1-45) (pdf format)
• CS508 - Lessons (1-45) (pdf format)
• CS508 - Power Point Slides (1-45)
• CS601 - Lessons (1-45) (pdf format)
• CS601 - Power Point Slides (1-45) old
• CS601 - Power Point Slides (1-220)
• CS602 - Power Point Slides (1-42,45)
• CS602 - Lessons (1-45) (pdf format)
• CS604 - Lessons (1-45) (pdf format)
• CS604 - Power Point Slides (1-45)
• CS605 - Lessons (1-45)
• CS605 - Power point Slides (1-12, 14-45)
• CS606 - Lessons (1-45) (pdf format)
• CS606 - Power Point Slides (1-45)
• CS607 - Lessons (1-45) (pdf format)
• CS607 - Power Point Slides (1-20, 25-40, 42-45)
• CS609 - Lessons (1-45) (pdf format)
• CS609 - Power Point Slides (1-27)
• CS610 - Lessons (1-45) (pdf format)
• CS610 - Power Point Slides (1-45)
• CS614 - Lessons (1-45) (pdf format)
• CS614 - Power Point Slides (1-40)
• CS615 - Lessons (1-45) (pdf format)
• CS701 - Power Point Slides (1-45)
• CS702 - Lessons (1-45) (pdf Format)
• CS702 - Power Point Slides (1-45)
• CS703 - Power Point Slides (1-45)
• CS704 - Power Point Slides (1-45)
• CS706 - Power Point Slides (1-45)
• CS707 - Power Point Slides (1-45)
• CS708 - Power Point Slides (1-45)
• CS709 - Power Point Slides (1-45)
• CS710 - Power Point Slides (1-45)
• CS711 - Lessons (1-45) (pdf Format)
• CS711 - Power Point Slides (1-45)
• CS712 - Lessons (23-45) (pdf Format)
• CS712 - Power Point Slides (1-35)
• CS716 - Power Point Slides (1-45)
• CS718 - Power Point Slides (1-45)
• CS723 - Power Point Slides (1-45)
• CS724 - Power Point Slides (1-45)
• CS726 - Power Point Slides (1-45)

ECO, EDU, ENG, ETH, FIN ...

• ECO401 - Lessons (1-45) (pdf Format)
• ECO402 - Lessons (1-45) (pdf Format)
• ECO403 - Lessons (1-45) (pdf Format)
• ECO404 - Lessons (1-45) (pdf Format)
• ECO501 - Lessons (1-45) (pdf Format)
• ECO601 - Lessons (1-45) (pdf Format)
• EDU301 - Lessons (1-43) (pdf Format)
• EDU301 - Power Point Slides (1-35, 37-43)
• EDU303 - Lessons (1-45) (pdf Format)
• EDU654 - Lessons (1-45) (pdf Format)
• ENG001 - Lessons (1-30) (pdf Format)
• ENG101 - Lessons (1-45) (pdf Format)
• ENG201 - Lessons (1-45) (pdf Format)
• ENG301 - Lessons (1-45) (pdf Format)
• ENG301 - Power Point Slides (1-37, 39-45)
• ENG401 - Lessons (1-15) (pdf Format)
• ENG401 - Power Point Slides (1-15)
• ETH201 - Lessons (1-16) (pdf Format)
• FIN611 - Lessons (1-45) (pdf Format)
• FIN611 - Power Point Slides (1-45)
• FIN621 - Lessons (1-45) (pdf Format)
• FIN622 - Lessons (1-45) (pdf Format)
• FIN623 - Lessons (1-45) (pdf Format)
• FIN624 - Lessons (1-15) (pdf Format)
• FIN625 - Lessons (1-45) (pdf Format)
• FIN630 - Lessons (1-45) (pdf Format)
• FIN704 - Lessons (Handouts) (pdf Format)

GEN, GSC, HRM, ISL, IT ...

• GSC101 - Lessons (1-29, 31-45) (pdf Format)
• HRM611 - Lessons (1-45) (pdf Format)
• HRM617 - Lessons (1-45) (pdf Format)
• HRM623 - Lessons (1-45) (pdf Format)
• HRM624 - Lessons (1-45) (pdf Format)
• HRM625 - Lessons (1-45) (pdf Format)
• HRM625 - Power Point Slides (23-45)
• HRM627 - Lessons (1-45) (pdf Format)
• HRM628 - Lessons (1-45) (pdf Format)
• ISL201 - Lessons (1-16) (pdf Format)
• ISL201 - Power Point Slide (1)
• IT430 - Lessons (1-45) (pdf Format)
• IT430 - Power Point Slides (1-45)

MCD, MCM, MGMT, MGT ...

• MCM101 - Lessons (1-45) (pdf Format)
• MCM301 - Lessons (1-45) (pdf Format)
• MCM304 - Lessons (1-45) (pdf Format)
• MCM310 - Lessons (1-45) (pdf Format)
• MCM311 - Lessons (1-45) (pdf Format)
• MCM401 - Lessons (1-45) (pdf Format)
• MCM404 - Lessons (1-45) (pdf Format)
• MCM411 - Lessons (1-45) (pdf Format)
• MCM431 - Lessons (1-15) (pdf Format)
• MCM501 - Lessons (1-15) (pdf Format)
• MCM511 - Lessons (1-45) (pdf Format)
• MCM514 - Lessons (1-45) (pdf Format)
• MCM515 - Lessons (1-45) (pdf Format)
• MCM516 - Lessons (1-45) (pdf Format)
• MCM517 - Lessons (1-15) (pdf Format)
• MCM520 - Lessons (1-15) (pdf Format)
• MCM531 - Lessons (1-15) (pdf Format)
• MCM532 - Lessons (1-15) (pdf Format)
• MCM601 - Lessons (1-15) (pdf Format)
• MCM604 - Lessons (1-15) (pdf Format)
• MCM610 - Lessons (1-15) (pdf Format)
• MGMT510 - Lessons (1-45) (pdf Format)
• MGMT611 - Lessons (1-45) (pdf Format)
• MGMT611 - Power Point Slides (1-45)
• MGMT622 - Lessons (1-45) (pdf Format)
• MGMT622 - Power Point Slides (1-45)
• MGMT623 - Lessons (1-45) (pdf Format)
• MGMT625 - Lessons (1-45) (pdf Format)
• MGMT627 - Lessons (1-45) (pdf Format)
• MGMT628 - Lessons (1-45) (pdf Format)
• MGMT629 - Lessons (pdf Format)
• MGMT630 - Lessons (1-45) (pdf Format)
• MGMT630 - Power Point Slides (1-45)
• MGMT728 - Lessons (1-45) (pdf Format)
• MGT101 - Lessons (1-45) (pdf Format)
• MGT101 - Power Point Slides (1-3)
• MGT111 - Lessons (1-45) (pdf Format)
• MGT201 - Lessons (1-45) (pdf Format)
• MGT211 - Lessons (1-45) (pdf Format)
• MGT211 - Power Point Slides (1-45)
• MGT301 - Lessons (1-45) (pdf Format)
• MGT301 - Power Point Slides (1-45)
• MGT401 - Lessons (1-45) (pdf Format)
• MGT401 - Power Point Slides (1-45)
• MGT402 - Lessons (1-45) (pdf Format)
• MGT404 - Lessons (1-45) (pdf Format)
• MGT404 - Power Point Slides (45)
• MGT411 - Power Point Slides (1-45)
• MGT411 - Lessons (1-45) (pdf Format)
• MGT501 - Lessons (1-45) (pdf Format)
• MGT502 - Lessons (1-45) (pdf Format)
• MGT502 - Power Point Slides (1-45)
• MGT503 - Power Point Slides (1-15, 17-45)
• MGT503 - Lessons (1-45) (pdf Format)
• MGT504 - Lessons (1-45) (pdf Format)
• MGT504 - Power Point Slides (1-45)
• MGT510 - Lessons (1-45) (pdf Format)
• MGT520 - Lessons (1-45) (pdf Format)
• MGT520 - Power Point Slides (1-45)
• MGT601 - Lessons (1-45) (pdf Format)
• MGT601 - Power Point Slides (1-45)
• MGT602 - Lessons (1-45) (pdf Format)
• MGT602 - Power Point Slides (1-45)
• MGT603 - Lessons (1-45) (pdf Format)
• MGT604 - Lessons (1-45) (pdf Format)
• MGT610 - Lessons (1-45) (pdf Format)
• MGT610 - Power Point Slides (1-45)
• MGT611 - Lessons (1-45) (pdf Format)
• MGT612 - Lessons (1-45) (pdf Format)
• MGT613 - Power Point Slides (1-45)
• MGT613 - Lessons (1-45) (pdf Format)
• MGT621 - Lessons (1-45) (pdf Format)
• MGT713 - Lessons (1-45) (pdf Format)
• MGT713 - Power Point Slides (1-45)

MKT, MTH, PAK, PHY, PSC ...

• MKT501 - Lessons (1-45) (pdf Format)
• MKT530 - Power Point Slides (1-27, 38)
• MKT530 - Lessons (1-45) (pdf Format)
• MKT610 - Lessons (1-45) (pdf Format)
• MKT610 - Supplements for Lessons 13 and 14
• MKT611 - Lessons (1-45) (pdf Format)
• MKT621 - Lessons (1-45) (pdf Format)
• MKT624 - Lessons (1-45) (pdf Format)
• MKT625 - Lessons (1-45) (pdf Format)
• MKT630 - Lessons (1-45) (pdf Format)
• MKT711 - Power Point Slides (1-45)
• MKT730 - Power Point Slides (1-19)
• MKT731 - Power Point Slides (1-27, 38)
• MTH001 - Lessons (1-32) (pdf Format)
• MTH101 - Lessons (1-45) (pdf Format)
• MTH101 - Power Point Slides (1-45)
• MTH202 - Lessons (1-45) (pdf Format)
• MTH301 - Lessons (1-45) (pdf Format)
• MTH302 - Lessons (1-45) (pdf Format)
• MTH302 - Power Point Slides (1-45)
• MTH401 - Lessons (1-44) (pdf Format)
• MTH501 - Lessons (1-45) (pdf Format)
• MTH501 - Power Point Slides (1-45)
• MTH601 - Lessons (1-45) (pdf Format)
• MTH601 - Power Point Slides (1-15)
• MTH603 - Lessons (1-45) (pdf Format)
• MTH603 - Power Point Slides (1-45)
• PAK301 - Lessons (1-45) (pdf Format)
• PAK302 - Power Point Slides (1-30)
• PHY101 - Lessons (1-45) (pdf Format)
• PHY301 - Power Point Slides (1-45)
• PHY301 - Lessons (1-45) (pdf Format)
• PSC201 - Lessons (1-45) (pdf Format)
• PSC401 - Lessons (1-45) (pdf Formats)

PSY, SOC, SPT, STA, STAT, URD, ZOO, ...

• PSY101 - Lessons (1-45) (pdf Format)
• PSY401 - Lessons (1-45) (pdf Format)
• PSY402 - Lessons (1-15) (pdf Format)
• PSY403 - Lessons (1-45) (pdf Format)
• PSY404 - Lessons (1-45) (pdf Format)
• PSY405 - Lessons (1-45) (pdf Format)
• PSY406 - Lessons (1-45) (pdf Format)
• PSY407 - Lessons (1-45) (pdf Format)
• PSY408 - Lessons (1-45) (pdf Format)
• PSY409 - Lessons (1-45) (pdf Format)
• PSY502 - Lessons (1-45) (pdf Format)
• PSY504 - Lessons (1-45) (pdf Format)
• PSY505 - Lessons (1-15) (pdf Format)
• PSY510 - Lessons (1-45) (pdf Format)
• PSY511 - Lessons (1-45) (pdf Format)
• PSY512 - Lessons (1-45) (pdf Format)
• PSY513 - Lessons (1-45) (pdf Format)
• PSY514 - Lessons (1-45) (pdf Format)
• PSY515 - Lessons (1-15) (pdf Format)
• PSY610 - Lessons (1-45) (pdf Format)
• PSY631 - Lessons (1-45) (pdf Format)
• PSY632 - Lessons (1-45) (pdf Format)
• SOC101 - Lessons (1-45) (pdf Format)
• SOC401 - Lessons (1-45) (pdf Format)
• STA301 - Lessons (1-45) (pdf Format)
• STA301 - Power Point Slides (1-45)
• STA630 - Lessons (1-45) (pdf Format)
• STA630 - Power Point Slides (1-45)
• STA730 - Power Point Slides (1-5)
• URD101 - Lessons (1-45) (pdf Format)
• ZOO301 - Lessons (pdf Format)
• ZOO401 - Lessons (pdf Format)
• ZOO502 - Lessons (1-265) (pdf Format)
• ZOO503 - Power Point Slides (1-160)
• ZOO505 - Lessons (pdf Format)
• ZOO510 - Lessons (pdf Format)

Course Codes

Select a course code for Handouts (pdf/PPTs)

VU Statistics

Vulms guidelines, important vu links, spirituality.

• Quranic Recitation
• Dora-e-Sahih Bukhari
• Hamd-e-Bari Taalaa
• Naat-e-Rasool (SAW)
• Soofiana Kalaam
• How to read Quraan?
• Video Lectures
• Online Quizes
• Islamic Books
• Handouts/PPT Slides
• History Books
• Dictionaries
• Poetry Books
• Pakistani Newspapers
• Pakistani Universities

© 2024 - genrica.com

Browse Course Material

Course info, instructors.

• Prof. Wojciech Matusik
• Prof. Frédo Durand

Departments

• Electrical Engineering and Computer Science

As Taught In

• Algorithms and Data Structures
• Graphics and Visualization
• Programming Languages

Learning Resource Types

Computer graphics, assignments, lecture notes.

You are leaving MIT OpenCourseWare

• Study Guides
• Homework Questions

Assignment 5 Spring 2023

• Computer Science