CS 232 Geometric Algorithms: Lecture 1

Slides:



Advertisements
Similar presentations
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
Advertisements

CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
Math 115b Section 1 (Summer 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
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.
Math 115b Section 5(Spring 06)  Instructor: Kerima Ratnayaka   Phone :  Office.
Math 115b Section 1H(Spring 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
CS 330 Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
MATH 310, FALL 2003 (Combinatorial Problem Solving) MoWeFr 1:20 McGregory 214.
COMP Introduction to Programming Yi Hong May 13, 2015.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
1 COMS 161 Introduction to Computing Title: Course Introduction Date: August 25, 2004 Lecture Number: 1.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
CS 311: Data Structures II Winter Quarter DESCRIPTION This class is a continuation of CS 260. The topics covered will include: file I/O in Java,
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
MAT 3730 Complex Variables Spring 2012
June 19, Liang-Jun Zhang MTWRF 9:45-11:15 am Sitterson Hall 011 Comp 110 Introduction to Programming.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
Physics 211 College Physics I. Introduction  Instructor:Larry Watson  Office:105 Witmer  Phone:   web:und.nodak.edu/instruct/lwatson/211.
Course Overview: Linear Algebra
ICS 151 Digital Logic Design Spring 2004 Administrative Issues.
CSc 120 Introduction to Computer Programing II
Networking CS 3470, Section 1 Sarah Diesburg
All important information will be posted on Blackboard
Welcome to Computers in Civil Engineering 53:081 Spring 2003
Networking CS 3470, Section 1 Sarah Diesburg
CS101 Computer Programming I
Course Information and Introductions
MATH/COMP 340: Numerical Analysis I
PAP Algebra 2 Contact Information Class Materials Beth Clayton Room A ext For this course, you will need the following.
CSc 1302 Principles of Computer Science II
Course Information and Introductions
COMP 283 Discrete Structures
CSC 135 section 60 or CSC Fall 2017.
CS5040: Data Structures and Algorithms
Database Design and Implementation
Introduction to Programming Spring 2016
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
CS 3343: Analysis of Algorithms
CS 201 – Data Structures and Discrete Mathematics I
Mrs. Laffin’s Policies and Procedures
Algebra 1B Contact Information Class Materials Beth Clayton Room A ext For this course, you will need the following.
Welcome to CS 1010! Algorithmic Problem Solving.
دانشكده برق دانشگاه علم و صنعت ايران
Welcome to CS 1340! Computing for scientists.
Welcome to CS 1010! Algorithmic Problem Solving.
CMSC 104 Problem Solving and Computer Programming Fall 2010
MA Fall 2016 Instructor: Matt Weaver Office: MATH 615
Welcome to CS 1301! Principles of Programming I.
Overview Basic Information Lecture Labs Lab Reports Homework Exams
COMS S1007 Object-Oriented Programming and Design in Java
CMSC104 Problem Solving and Computer Programming Fall 2010
COMS 161 Introduction to Computing
COMS 261 Computer Science I
Back to School Night Math 2
C Programming Lecture 1 : Introduction
C Programming Lecture 1 : Introduction
Course policy.
CS 474/674 – Image Processing Fall Prof. Bebis.
MA Fall Instructor: Tim Rolling -Office: MATH 719 -
CPE 626 Advanced VLSI Design, Spring 2002 Admin
Welcome! Mr. Stan Debiec School Year.
Presentation transcript:

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

Instructors Main Lectures: Professor Shang-Hua Teng TR 2:00-3:30 PM (COM 213) Sections: TF Scott Russell CAS CS232 A2 648134 Monday 3:00pm-4:00pm in CAS 204A CAS CS32 A3 648147 Tuesday 12-1:00pm in CAS B20

Office Hours Professor Shang-Hua Teng Email: steng@cs.bu.edu Office: MCS-276 Office Hours: TR 12:30-2:00pm (or by appointment) Office Phone: 358-2596

Office Hours Teaching Fellow: Scott Russell Email: srussell@cs.bu.edu Office: PSY-223 Office Hours: TBA (or by appointment) Office Phone: 3-8921

Important Dates: Due day of each homework See class webpage Quiz 1: Tuesday, Feb. 3 (in class) Midterm: Thursday, Feb. 26 (in class) Quiz 2: Most likely March 30th (TBA) Final: to be posted

Grading 30% - written assignments 10% - quiz 1 20% - midterm 15% - quiz 2 25% - final

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).

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 1: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 1: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.

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.

Policy Regarding Policy: 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.

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.

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)

Geometry + Algorithms + Applications Geometric Concepts Linear Algebra Representations/Connections Algorithms

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

Unstructured Meshes

Delaunay Triangulations

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

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.

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

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

Question Experience with Matlab? Experience with other programming languages?