550 likes | 697 Vues
Join Dr. Scott Schaefer for an in-depth exploration of Geometric Modeling in CSCE 645/VIZA 675. This course covers essential topics such as polynomial curves and surfaces, surface representations, and differential geometry, focusing on applications in industrial design, movies, and animation. Students are expected to have programming experience in C/C++ and a foundational understanding of linear algebra. Assessment includes homework and a class project that promotes innovation and research integration. For more details on assignments and office hours, visit the course website.
E N D
Geometric Modeling CSCE 645/VIZA 675 Dr. Scott Schaefer
Course Information • Instructor • Dr. Scott Schaefer • HRBB 527B • Office Hours: MW 10:15am – 11:15am (or by appointment) • Website: http://courses.cs.tamu.edu/schaefer/645_Fall2010
Geometric Modeling • Surface representations • Industrial design
Geometric Modeling • Surface representations • Industrial design • Movies and animation
Geometric Modeling • Surface representations • Industrial design • Movies and animation • Surface reconstruction/Visualization
Topics Covered • Polynomial curves and surfaces • Lagrange interpolation • Bezier/B-spline/Catmull-Rom curves • Tensor Product Surfaces • Triangular Patches • Coons/Gregory Patches • Differential Geometry • Subdivision curves and surfaces • Boundary representations • Surface Simplification • Solid Modeling • Free-Form Deformations • Barycentric Coordinates
What you’re expected to know • Programming Experience • Assignments in C/C++ • Simple Mathematics Graphics is mathematics made visible
How much math? • General geometry/linear algebra • Matrices • Multiplication, inversion, determinant, eigenvalues/vectors • Vectors • Dot product, cross product, linear independence • Proofs • Induction
Grading • 50% Homework • 50% Class Project • No exams!
Class Project • Topic: your choice • Integrate with research • Originality • Reports • Proposal: 9/15 • Update #1: 10/13 • Update #2: 11/10 • Final report/presentation: 12/13
Class Project Grading • 10% Originality • 20% Reports (5% each) • 5% Final Oral Presentation • 65% Quality of Work http://courses.cs.tamu.edu/schaefer/645_Fall2010/assignments/project.html
Points • 1 p=p • 0 p=0 (vector) • c p=undefined where c 0,1 • p – q = v (vector)
Convex Sets • If , then the form a convex combination
Convex Hulls • Smallest convex set containing all the
Convex Hulls • Smallest convex set containing all the
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull
Convex Hulls • If pi and pj lie within the convex hull, then the line pipj is also contained within the convex hull