cs 232 geometric algorithms: lecture 1
DESCRIPTION
CS 232 Geometric Algorithms: Lecture 1. Shang-Hua Teng Department of Computer Science, Boston University. Instructors. Main Lectures: Professor Shang-Hua Teng TR 3:30-5:00 PM (GCB 204) Sections: TF Quan Yuan CAS CS232 A2 Friday 11:00am—12:00pm in MCS B33. Office Hours. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/1.jpg)
CS 232 Geometric Algorithms: Lecture 1
Shang-Hua Teng
Department of Computer Science, Boston University
![Page 2: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/2.jpg)
Instructors Main Lectures:
Professor Shang-Hua Teng
TR 3:30-5:00 PM (GCB 204)
Sections: TF Quan Yuan
CAS CS232 A2
Friday 11:00am—12:00pm
in MCS B33
![Page 3: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/3.jpg)
Office Hours
Professor Shang-Hua Teng
Email: [email protected]: MCS-276Office Hours: TR 1:00-2:30pm
(or by appointment)Office Phone: 358-2596
![Page 4: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/4.jpg)
Office Hours
Teaching Fellow: Scott Russell
Email: [email protected]: mcs 263Office Hours: Monday 3-5pm
Wed. 2-3pm
(or by appointment)Office Phone: 3-8921
![Page 5: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/5.jpg)
Important Dates: Due day of each homework
See class webpage www.cs.bu.edu/~steng/teaching/Spring2005
Quiz 1: Thursday, Feb. 24 (in class) Midterm: Thursday, March 24 (in class) Quiz 2: Most likely April 19 (In class) Final: to be posted
![Page 6: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/6.jpg)
Grading
35% - written assignments10% - quiz 120% - midterm
10% - quiz 225% - final
![Page 7: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/7.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/8.jpg)
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 2:45pm. 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 2:45pm, 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. The late penalty will be exponential in the minutes it is
late (2^m-1, where m is the number of minutes you are late - that's one way to learn about the perils of exponential growth ). The reason the penalty is so steep is that I want to discourage you from finishing at the last minute and coming late to class as the result.
![Page 9: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/9.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/10.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/11.jpg)
Policy If you ask to re-grade your homework please
write out the basis of your request. If the grader finds no basis for your complaint,
then 10 points will be taken off your original grade unless the grade is changed.
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/12.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/13.jpg)
Geometry + Algorithms + Applications
Geometric Concepts Linear Algebra Representations/Connections Algorithms
![Page 14: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/14.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/15.jpg)
Unstructured Meshes
![Page 16: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/16.jpg)
Delaunay Triangulations
![Page 17: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/17.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/18.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/19.jpg)
Books + Notes
The main background text book is Introduction to Linear Algebra
by Gilbert Strang I will also hand out notes, especially on some
geometric algorithms
![Page 20: CS 232 Geometric Algorithms: Lecture 1](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/20.jpg)
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](https://reader035.vdocument.in/reader035/viewer/2022070401/568136c3550346895d9e5f35/html5/thumbnails/21.jpg)
Question
Experience with Matlab?
Experience with other programming languages?