21
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

  • View
    218

  • Download
    0

Embed Size (px)

Citation preview

Page 1: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

CS 232 Geometric Algorithms: Lecture 1

Shang-Hua Teng

Department of Computer Science, Boston University

Page 2: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Instructors Main Lectures:

Professor Shang-Hua Teng

TR 3:50-5:00pm

Sections: TF Kyle Burke

CAS CS232 A2

Wednesday 12-1pm in MCS B33

Page 3: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Office Hours

Professor Shang-Hua Teng

Email: [email protected]: MCS-276Office Hours: T 1:30 – 3:pm

R 1 – 2:30pm

(or by appointment)Office Phone: 358-2596

Page 4: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Office Hours

Teaching Fellow: Kyle Burke

Email: [email protected]: PSY 223Office Hours: W: 2- 3:30pm

F: 1:30-3pm

(or by appointment)Office Phone: 8-2359

Page 5: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Important Dates: Due day of each homework

See class webpage www.cs.bu.edu/~steng/teaching/Spring2007

Quiz: Thursday, Feb. 22 (in class) Midterm: Thursday, March 22 (in class) Final: May TBA

Page 6: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Grading

30% - written assignments

5 % - project I

10 - project II

10% - quiz

20% - midterm

25% - final

Page 7: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Homework Write problems in order they are assigned and one

problem per page, or just try to separate them clearly so one can see the end of one problem and the beginning of the next one.

The hard-copy (paper) submissions are preferred, so, please send me by email your homework submissions only if you cannot make it to the University on time. But if you do submit electronically:

Make sure to put your name in all electronically submitted files (even if you submit your file by email).

Make sure text file you submit can be printed out and it comes out properly.

Use a format that is well known and easy to open/read (just text format would do it).

Page 8: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

No late assignments will be accepted. (Homework Box): If you come to CS building earlier, try

submit the hws to the submission box up until 3:15pm. I will be taking the hw's out from the submission box shortly after that time on my way to the class. If you do not make it to the box before 3:15pm, bring the hw to the class.

(Classroom) I will also accept the hw's up until the class start.

I will stop accepting the hw's when the class starts. If you cannot make it to the class on time, please make

sure to submit the hw ahead of time.

Page 9: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Comments from the grader:

The main issue is readability, so for example, if you need to draw something, it is better to do it by hand, than to mess with text formatting of drawing pictures in text files. Please, be sure that if you are hand-writing a hw, then your hand-writing is perfectly clear.

Page 10: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Policy Regarding Policy:

1. If you submit the wrong file or a file with the wrong filename, this includes submission of an empty directory, submission of an executable, etc., then 50% will be taken off from your original grade. Note: In such cases you will be required to show a proof that your source file has a last modification date prior to the submission deadline. Note: attempts to cheat on this will be reported. See Academic Conduct.

Page 11: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Policy If you ask to re-grade your homework please

write out the basis of your request.

Note: This is not to say that we discourage you from disputing your grade, but rather we encourage you to read and understand the comments of the grader before complaining.

Page 12: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Policy Under no circumstances should you be

copying or using the work of others.It is fine to discuss problems (in general terms) with others, but the specifics of a solution and all of the writing should be done without any collaboration. (See also Academic Conduct)

Page 13: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Geometry + Algorithms + Applications

Geometric Concepts Linear Algebra Representations/Connections Algorithms

Page 14: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Why Geometry?

Useful in many practical applications Computer Graphics Imaging Processing Robotics (path planning) Network Design Information Clustering Engineering and Scientific Simulations Multi-Variable Optimizations

Page 15: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Unstructured Meshes

Page 16: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Delaunay Triangulations

Page 17: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Why Linear Algebra? Most natural representations of basic

geometric objects geometric transformations

Efficient linear algebra algorithms that can be used to solve geometric problems

Language for high-dimensional geometry

Page 18: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Why Algorithms?

Algorithm is one of the most important developments in computer science

Geometric and linear algebra algorithms make use of the underlying mathematical structures,

however without efficient algorithms, these mathematical structures may not be useful in computer applications.

Page 19: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Books + Notes

The main background text book is Introduction to Linear Algebra

by Gilbert Strang I will also hand out notes, especially on

applications

Page 20: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Objectives of This Course

The purpose of this class is to Learn linear algebra in the context of geometric

applications and algorithms Learn geometric concepts and structures using the

language of linear algebra

Page 21: CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University

Question

Experience with Matlab?

Experience with other programming languages?