Course Info

• This course covers basic algorithms and systems that deal with three-dimensional modeling and processing in computer graphics, animation, and games. In particular, special emphasis will be given on the following topics:
  • Geometric modeling of freeform objects;
  • Geometric constraints for freeform objects;
  • Efficient algorithms for freeform geometric models.
• Classroom : 302-106
• Time : Mon, Wed 17:00 - 18:15

Syllabus

Bulletin Board

Course Notes

• Chapter 1
• Chapter 2
• Chapter 3
• Chapter 4
• Chapter 5
• Chapter 6
• Chapter 7
• Chapter 8
• Chapter 8 Corrections
• Chapter 9
• Chapter 10
• Chapter 11
• Chapter 12
• Chapter 13
• CAGD Textbook Errata
• Subdivision Surfaces
• Bounding Volume Hierarchy
• Curve Processing
• Morphology
• nishita bezier clipping
• Biarc Approximation
• Offsets, Sweeps and Minkowski sums for Freeform Curves and Surfaces
• BCA Offset

Links

• GJK Algorithm
• GPU-Accelerated Minimum Distance and Clearance Queries
• Surface algorithms using bounds on derivatives
• Efficient offset trimming for deformable planar curves using a dynamic hierarchy of bounding circular arcs
• Comparision of Three Bounding Regions with Cubic Convergence to Planar Freeform Curves
• Offset

Resources

• Exams & Quizzes
• Old Exams & Quizzes
  • 2012: Quiz 1 | Quiz 2 | Midterm
  • 2015: Quiz 1 | Quiz 2 | Midterm | Quiz 3

Instructor

• Myung-Soo Kim
• Office : 302-330
• Tel : 880-1838
• Fax : 889-1838
• E-mail : mskim at snu.ac.kr
• Homepage : http://3map.snu.ac.kr/mskim

Teaching Assistant

• Yunku Kang
• Office: 302-315-1
• Tel: 880-1840
• E-mail: yunku2002 at 3map.snu.ac.kr

Prerequisites

• Computer Graphics (4190.410)

Textbook

• Gerald Farin and Dianne Hansford, The Essentials of CAGD, A K Peters, 2000.

Grade

• Midterm : 100 pts
• Final : 100 pts
• Homeworks, Quizzes & Projects : 100 pts