Aims of the courses are

 
• to introduce the fundamental concepts of computational geometry; 
• to study the techniques of geometric construction. 

 
Upon completion of the courses, students should be able to

• describe and construct basic geometric shapes and concepts by computational means; 
• understand the invariance properties of Euclidean geometry by groups of transformations; 
• use the concepts of projective geometry in computer graphics based on vector geometry; 
• describe the differential properties of curves and surfaces by differential geometry and its application in computer aided design; 
• appreciate non-classical geometry through the study of fractals; 

construct basic algorithms in computational geometry such as point location, convex hull, separation & intersections, Delaunay triangulation and study the algorithmic complexity, (B6 course only).

 
Lecture Note
All lecture notes of Computational Geometry have been typed. The files are pdf files formats.

Java Program
Some Java Programs are written to solve computational geometry problems, such as convex hull and triangulation.

Reference Books
There are some recommended books and you may visit the offical page of the books.

Relevant Links
There are a lot of web sites related to computational geometry. Here, you can find many interesting web pages which cover beautiful pictures, jave programs, real applications and other recent paper and lecture notes.

CG Gallery

Some 3-D graphs ploted by Maple such as Helicoid and Catenoid, Srakes, Surfaces of Revolution, Cylinder, Intersecting Surfaces, Surface in cylindrical & z-cylindrical coordinates, Torus,Vary Surfaces, Ruled Surfaces, Intersecting Surfaces, Monkey saddle, Monkey saddle II, Klein bottle, Polyhedral & Mobiusband.

 

Newsgroup

MA students can discuss computational geometry in the newsgroup and Dr. Chung may use the newsgroup to give assignments to the students.