Chunks 41 to 50

CHUNK 41
TITLE Vertex functions 1
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 50 lines of code which uses vertex functions.
OUTCOME

• Be able to understand a program that uses vertex functions.

REFERENCE Greenberg 209--225
HINT Use anti-aliasing
PROGRAM Modify the program that you present in the text so that its functionality changes

CHUNK 42
TITLE Vertex functions 2
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 75 lines of code which uses vertex functions.Try and make it concepuually similar to that found in Greenberg 220--221 but more complicated
OUTCOME

• Be able to understand a program that uses vertex functions.

REFERENCE Greenberg 209--225
HINT Don't worry about the kludgy approach.
PROGRAM Modify the program that you present in the text so that its functionality changes

CHUNK 43
TITLE Vertex functions 3
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found in Greenberg 224--225 but more complicated
OUTCOME

• Be able to understand a program that uses vertex functions.

REFERENCE Greenberg 209--225”
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes

CHUNK 44
TITLE Vertex functions 4
DESCRIPTION
This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found in the program in Greenberg 231 but more complicated
OUTCOME

• Be able to understand a program that uses vertex functions.

REFERENCE Greenberg 209--225
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes

CHUNK 45
TITLE Vertex functions 5
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found to the program in Greenberg 235 but more complicated
OUTCOME

• Be able to understand a program that uses vertex functions.

REFERENCE Greenberg 209--225
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes

CHUNK 46
TITLE Bringing it together 1
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME

• Understand a large Processing program

REFERENCE Any facility presented in Greenberg up to 237
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed

CHUNK 47
TITLE Bringing it together 2
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME

• Understand a large Processing program

REFERENCE Any facility presented in Greenberg up to 237
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed.

CHUNK 48
TITLE Bringing it together 3
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME

• Understand a large Processing program

REFERENCE Any facility presented in Greenberg up to 237
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed

CHUNK 49
TITLE Lines and acceleration
DESCRIPTION Provide a little revision on lines the way that Greenberg does about lines. Describe a line as a series of points and develop a program that gnerates a series of lines as points
OUTCOME

• Be able to develop a simple program that generates a loine from a series of points

REFERENCE Greenberg 242--246
HINT Talk about a line being a distance vs time graph and the slope the acceleration
PROGRAM No program needed

CHUNK 50
TITLE Generating a simple curve
DESCRIPTION Use the idea of a curve having acceleration in two directions to generate a simple curve. Describe a program that generates a number of curves in an interesting way.
OUTCOME

• Develop a program that generates simple curves.

REFERENCE Greenberg 246--249
HINT You may like to use different colours
PROGRAM Develop another program that is similar in complexity to the one that you describe.