10
Group Teaching and Learning 3 extra points

Group Teaching and Learning 3 extra points. Lecture 11 Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm Group

Embed Size (px)

Citation preview

Page 1: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Group Teaching and Learning

3 extra points

Page 2: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Lecture 11

Group A: Line drawing– DDA algorithm– Midpoint algorithm– Bresenham’s line algorithm

Group B: Circle Generating Algorithms– Bresenham’s circle algorithm– Extension to Ellipse drawing

Page 3: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Lecture 12

Group C: Polygon Filling– Scan-line Conversion Approaches– Area Filling Approaches

• 4-connected area and 8-connected area• Recursive algorithm for area filling

Group D: Antialiasing– Aliasing Problems of Raster Graphics– Antialiasing Methods

Group E: Clipping– Cohen-Sutherland Algorithm – Cyrus-Beck/Liang-Barsky Parametric Line Clipping

Page 4: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

• Each teaching group: 2-3 people• Lecture slides (.PPT) will be online after L8.• Select one topic and write your name under

corresponding topic in the breaks of L9 and L10

Page 5: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

• 10m: teaching group discussion (students group can have a look at the slides copies of that lecture)

Group A-B (Group C-E)• 1-2m: a teacher representative from Group A

introduces general problems, what the students will learn from this topic)

• Teaching and learning

Page 6: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Lecture 11 (Apr. 6, 4-6pm)

Group A Group B

Students StudentsStudents Students Students

S1: Sit in teachers’ table or students’ table S2: Group discussion (10m)

S3: One teacher from GA (1-2m) S4: Each teacher (GA) goes to one of the students’ table and teach that student group (40m)

Page 7: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Lecture 11 (Apr. 6, 4-6pm)

Group BGroup A

Students StudentsStudents Students Students

S5: One teacher from GB (1-2m) S6: Each teacher (GB) goes to one of the students’ table and teach that student group (30m)

Page 8: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Group E

Lecture 12 (Apr. 13, 4-6pm)

Group C Group D

Students StudentsStudents Students

S1: Sit in teachers’ table or students’ table S2: Group discussion (10m)

S3: One teacher from GC (1-2m) S4: Each teacher (GC) goes to one of the students’ table and teach that student group (25m)

Page 9: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Group E

Lecture 12 (Apr. 13, 4-6pm)

Group DGroup C

Students StudentsStudents Students

S3: One teacher from GD (1-2m) S4: Each teacher (GD) goes to one of the students’ table and teach that student group (20m)

Page 10: Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group

Group C

Lecture 12 (Apr. 13, 2-4pm)

Group EGroup D

Students StudentsStudents Students

S7: One teacher from GE (1-2m) S8: Each teacher (GE) goes to one of the students’ table and teach that student group (25m)