560 likes | 760 Views
Geometric Modeling CSCE 645/VIZA 675. Dr. Scott Schaefer. Course Information. Instructor Dr. Scott Schaefer HRBB 527B Office Hours: MW 9:00am – 10:00am (or by appointment) Website: http://courses.cs.tamu.edu/schaefer/645_Spring2013. Geometric Modeling. Surface representations
E N D
Geometric Modeling CSCE 645/VIZA 675 Dr. Scott Schaefer
Course Information • Instructor • Dr. Scott Schaefer • HRBB 527B • Office Hours: MW 9:00am – 10:00am (or by appointment) • Website: http://courses.cs.tamu.edu/schaefer/645_Spring2013
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: 2/7 • Update #1: 3/7 • Update #2: 4/9 • Final report/presentation: 4/25
Class Project Grading • 10% Originality • 20% Reports (5% each) • 5% Final Oral Presentation • 65% Quality of Work http://courses.cs.tamu.edu/schaefer/645_Spring2013/assignments/project.html
Honor Code • Your work is your own • You may discuss concepts with others • Do not look at other code. • You may use libraries not related to the main part of the assignment, but clear it with me first just to be safe.
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