|STATIC INFO:||Course Info | Course Desc | Textbook | Course Work | Schedule|
|DYNAMIC INFO:||NYU Bboard | Homework Directory | Lecture Notes | Manuscript on EGC|
|RESOURCES:||Core Library. | Cygwin | Links|
|Professor Chee Yap||Room: WWH 416, Tel: 998-3115, email: yap "at" cs.nyu.edu|
|Lectures||Tue 5:00-6:50, WWH 813|
|Office Hours||Mon 4:00-5:00, and by appointment|
|NYU Bboard||Class discussions, email lists, announcements, grades, etc.
Use your NYU NetID to login, then click our class link
Invariably, the first step is to compute a combinatorial approximation of S from the given metric/local information. This combinatorial approximation is called a mesh (or complex). This is the meshing problem. Meshing is a critical step -- as the interface between continuous and discrete computation. The computation involves some combination of numerical and algebraic techniques. A big question is how to guarantee that this step is correct in the presense of numerical errors. (Most published algorithms have no guarantees.) The computational methods depend on the representation of the object. E.g., we would need very different algorithms if the surface S in the previous example were represented by Bezier patches.
The next step is to compute the desired topological property of S from an appropriate mesh representation. The mathematical and computational tools such as homology, Morse theory and subdivision schemes will be developed.
Computational Topology: An Introduction, G.Rote and G.Vegter.
Meshing of Surfaces, J.-D.Boissonnat, D.Cohen-Steiner, B.Mourrain, G.Rote, G.Vegter.
Geometry and Topology for Mesh Generation, H.Edelsbrunner. Cambridge Press, 2001.
Topology for Computing, A.Zomorodian. Cambridge University Press, 2005.
Subdivision Methods for Geometric Design, J.Warren and H.Weimer. Morgan Kaufmann Pub., 2002.
Grade is based on Homework (30%), 2 Tests (30%), Project (40%).
Homework includes programming assignments.
Programming will be in C/C++ and includes the use of the Core Library.