【物理】第四讲 Graphics ProgrammingI.pptVIP

Graphics Programming (I) Outline The Sierpinski Gasket Programming 2D Applications The OpenGL API The Sierpinski Gasket The Sierpinski gasket is an object that can be defined recursively and randomly. However, it has properties that are not at all random. Chaos game Consider 3 vertices P1, P2, and P3 of a triangle as shown on the left. Starting at any point on the plane, point 0, choose a vertex randomly of the three vertices. Draw a point on the plane half way between the current point and the vertex chosen, point 1, this now becomes the current point. Repeat this process indefinitely, each time drawing a point halfway between the current point and a randomly chosen vertex. Result of the Game Real World Gaskets Sierpinski Algorithm Given 3 vertices of a triangle Starting at any point P on the plane, initial point, choose a vertex V randomly. Draw a point M half way P and V. M now becomes the current point, P. Repeat this process, each time drawing a point halfway between the current point and a randomly chosen vertex. Pseudo-code We use the drawing of the Sierpinski gasket as a sample problem. A possible form for our 1st program might be as the left. Although our final OpenGL program will have a different organization, it will be almost that simple. main () { initialize_the_system (); for (some_number_of_points) { pt = generate_a_point (); display_the_point (pt); } clean_up (); } Sierpinski carpet Instead of removing the central third of a triangle, the central square piece is removed from a square sliced into thirds horizontally and vertically. Fractal Antenna Fractal antenna based upon the carpet replaces the usual rubbery stalk. A fractal arrangement can combine the robustness of a random array and the efficiency of a regular array with a much lower number of elements. Core of the Implementation Core: generating and displaying points. How do we represent points in space? Should we use a 2D, 3D, or other representation? Programming 2D Applications