Fall 2017 - CMPT 813 G100

Computational Geometry (3)

Class Number: 7117

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 5 – Dec 4, 2017: Mon, Fri, 11:30 a.m.–12:20 p.m.
    Burnaby

    Sep 5 – Dec 4, 2017: Wed, 11:30 a.m.–12:20 p.m.
    Burnaby

  • Instructor:

    Binay Bhattacharya
    binay@sfu.ca
    1 778 782-3133

Description

CALENDAR DESCRIPTION:

This course covers recent developments in discrete, combinatorial, and algorithmic geometry. Emphasis is placed on both developing general geometric techniques and solving specific problems. Open problems and applications will be discussed.

COURSE DETAILS:

This course is cross-listed with CMPT 406

Computational Geometry (CG) involves the design and analysis of algorithms and data structures for the solutions to algorithmic problems of a computational nature. Part of the interest in CG is due to its wealth of applications, including areas as far-reaching as: medical imaging, geographic information systems (GIS), machine learning, games, robotics, computer vision, computer graphics, and computer-aided design and manufacturing (CAD/CAM). An interesting website (http://cgm.cs.mcgill.ca/(tilda)godfried/) gives a peek to the computational geometry related activities of Prof. Godfried Toussaint. (Look at the visitor index!) Computational geometry is especially well-suited for computer science education, both in the classroom curriculum and also for independent research. It is also an important topic in competitive programming contest. Some of the objectives of the course are - develop problem solving skills, design geometric algorithms (think geometrically), to be better at applications that require geometric algorithms. This course is cross-listed with CMPT 406 (Computational Geometry). The graduate students are expected to perform in the course at much higher level. The student is required to do an additional substantial project on a research topic of mutual interests. Prerequisite Requirement: A course in design and analysis of algorithms

Topics

  • Polygon Triangulation
  • Convex Hulls
  • Voronoi Diagrams
  • Arrangements
  • Search and Intersections
  • Applications : machine learning, robotics, graphics

Grading

NOTES:

The course grade will be determined by performance on assignments, a project and a final. The class participation is encouraged. Some class assignments may require some programming. The details will be further discussed in the class.

Materials

MATERIALS + SUPPLIES:

Reference Books

  • Computational Geometry - An Introduction, F. Preparata, Michael Shamos, Springer Verlag, 1985, 9780387961316

REQUIRED READING:

Computational Geometry: Algorithms and Applications,
Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars,
Springer-Verlag,  Latest edition
ISBN: 9783540779735

Graduate Studies Notes:

Important dates and deadlines for graduate students are found here: http://www.sfu.ca/dean-gradstudies/current/important_dates/guidelines.html. The deadline to drop a course with a 100% refund is the end of week 2. The deadline to drop with no notation on your transcript is the end of week 3.

Registrar Notes:

SFU’s Academic Integrity web site http://students.sfu.ca/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS