Written in front:
1: The question types are mainly single-choice questions + multiple-choice questions + true-false questions + calculation questions. There are a lot of questions, so you must arrange your time reasonably.
2: The small questions are too trivial, so I won't review them. They are mostly small questions that have been done in the courseware, um.
ps: Classroom exercises are summarized in [Computer Graphics] Classroom Exercises Summary_MorleyOlsen's Blog-CSDN Blog
3: There will be time to update the handwritten notes organized before the end of the period. (Already supplemented in this article)
4: Question bank for reference (just look at what we have learned): Computer Graphics 3 sets of papers with answers
Exam syllabus
Chp2：
DDA Numerical Differentiation
Midpoint line method
bresenham line drawing
eighth circle
midpoint circle method
Bresenham circle (rule of quarters)
Ellipse Scan Conversion Algorithm
Chp3：
cohen-Sutherland clipping method
Mid-point segmentation and clipping
Liang-Barsky Algorithm
Sutherlan-Hodgman edge-by-edge clipping method
Weiler-Atherton clipping method
Text Clipping Classification
Chp4：
Two-dimensional various transformations and their corresponding matrices
Three-dimensional analogy (especially the rotation transformation around the three coordinate axes)
Chp5：
Classification of projections
The method of drawing three views on a plane (how to rotate side view and top view)
How to dot the orthographic drawing after rotation
Z-Buffer algorithm (improved and original)
Judgment method of polygon and pixel point inclusion relationship
Interval scan method
Region sub-segmentation method Warnock
Chp6：
Parametric Continuity and Geometric Continuity
Bezier surfaces and curves
handwritten notes
Flowers are over!
Big topic review
(I don’t care about the order of the questions =.=, I can only say that I try to remember as much as possible)
1: Calculate the pixels between two points with the midpoint line algorithm, k>1. Draw the image.
2: Write the pseudocode of the Z-Buffer algorithm with only one depth buffer variable, and two methods for judging the inclusion relationship between polygons and pixels.
3: Write the calculation result of the composite transformation matrix. The transformation of the graphics (in two-dimensional coordinates) is given in the title, and you need to push the T matrix and calculate it yourself.
4: Explain four lines of code in the walk-skeleton in the graphics homework.
5: Given some points, t=1/2 is known, calculate the Bezier curve, and draw the image.
6: Draw a circle with the quartering method, find the drawing method of the first quadrant arc with a radius of 7, and write the position of each pixel.
7: The application of the cohen-Sutherland clipping method, write the main idea of the algorithm, calculate the pixels and draw the image.