INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

CSN-523: Computational Geometry

Lecture 1: Introduction

Dr. Sudip Roy

Assistant Professor
Department of Computer Science & Engineering
Piazza Class Room: https://piazza.com/iitr.ac.in/spring2017/csn523/home
Moodle Site: http://moodle.iitr.ac.in/course/view.php?id=23 [Enrollment Key: csn523@2017]
Course Information:
This is a course of Four (4) credit.
It consists of Three (3) lecture hours per week and One (1) hour tutorial.
The basic thrust of the course would be to familiarize the students with
the design and analysis of efficient algorithms for geometric problems,
typically in low dimensions (2,3,..). Its goal is to make students familiar
with the important techniques and results in computational geometry, and
to enable them to attack theoretical and practical problems in various
application domains. These problems arise in a wide range of areas,
including CAD, VLSI, robotics, computer graphics, molecular biology,
GIS, spatial databases and sensor networks.
We will try to stick to the basic course outline as given in Syllabus, but
may deviate a bit.
Prerequisite: CSN-212 (Design and Analysis of Algorithms).
Performance Evaluation: Class Work Sessional (CWS) = 25%, Mid-Term
Exam (MTE) = 25%, End-Term Exam (ETE) = 50%.
CWS (25% marks) will be computed by a weighted sum of different
components.
2
Course Information:
Four components of CWS (25% marks):
1. Attendance (A):
a. 75% attendance is mandatory to get allowed to sit for MTE and ETE (BE
CAREFUL ABOUT THAT).
b. Data will be recorded in both Lecture and Tutorial classes.
c. We may randomly verify your attendance on any lecture class. If any
PROXY ATTENDANCE is caught on any day, the record will be immediately
made HALF of the current record of attendance (BE CAREFUL ABOUT
THAT).
d. Participation in Piazza discussion will also be recorded. A discussion after
everyday lecture class (each day there will be one or two students who will
be in-charge of rolling on the discussion) shall be hosted. This should be a
real discussion of the topic taught and not just a reiteration of "classroom
notes". New materials can also be exchanged over the discussion thread in
Piazza. Any malpractice in Piazza shall lead to immediate deregistration of
the candidate trapped.

3
Course Information:
2. Tutorial Classes (TC):
a. Tutorial Sheets will be given after teaching some topics in a week before
the Tutorial class.
b. To be solved in tutorial class only.
c. Weekly performances will be recorded.

3. Term Projects (TP):

a. Each group will be given a topic to study in-depth in the whole semester.
b. The topic may be based on some recent research domain/problem
applying Computational Geometry.
c. How/what to write in Term Project: (a) Problem statement / formulation,
(b) Solution approaches with short descriptions of algorithms, (c) Time and
space complexities of the algorithms, (d) Any new thought to solve the
problems applying your knowledge gained in the course.
d. Interim report to submit just after MTE and final one to submit before ETE.
e. Group-wise submission. Online submission through Moodle.

4
Course Information:
4. Coding Projects (CP):
a. Two CPs in whole semester
b. Online submission through Moodle
c. Group-wise submission

CWS will be computed by a weighted sum of different components like (A,

TC, TP and CP).

Instruction: Form your group in Moodle. Each group can have at most TWO
students. Last date of forming group in Moodle: Jan 20, 2017. After that
remaining students will be considered as a group of SINGLE student.

Office time to meet the Course Instructor (For any kind of doubt
clearing): Monday - Friday (5:00 pm - 6:00 pm)
(To confirm the availability, please send an email before coming)

5
Online Course Management:

Course Website: http://faculty.iitr.ac.in/~sudiproy.fcs

Piazza Classroom: https://piazza.com/iitr.ac.in/spring2017/csn523/home

Moodle site: http://moodle.iitr.ac.in/course/view.php?id=23 [Enrollment

Key: csn523@2017]

6
Teaching Assistants:

Ankur Gupta [Research Scholar]

Sumit Sharma [Research Scholar]
Ananya Singla [MTech II year student]
Anita [MTech II year student]
Nishant Kamal [MTech II year student]
Shalu [MTech II year student]
Varsha Agarwal [MTech II year student]

7
Books:

[B1] (JOR) Joseph O'Rourke,

Computational Geometry in C,
Cambridge University Press.

[B2] (Four Authors) M. de Berg,

M. van Kreveld, M. Overmars, O.
Schwarzkopf, Computational
Geometry: Algorithms and
Applications (2nd Edition),
Springer-Verlag.

Franco P. Preparata and Michael

Ian Shamos, Computational
Geometry: An Introduction,
Springer-Verlag.
8
Good References:

[R1] Lecture notes by Prof. David Mount, Department of

Computer Science, University of Maryland, USA.

9
Computational Geometry (CG):

Computational geometry is a branch of computer

science devoted to the study of algorithms which can be
stated in terms of geometry. Some purely geometrical
problems arise out of the study of computational
geometric algorithms, and such problems are also
considered to be part of computational geometry.
Many application areas are like computer graphics,
computer-aided design and manufacturing (CAD/CAM),
robotics (motion planning and visibility problems),
geographic information systems (GIS) (geometrical location
and search, route planning), integrated circuit design (IC
geometry design and verification), computer-aided
engineering (CAE) (mesh generation), computer vision (3D
reconstruction).
10
Basic Concepts and Definitions:

Point
Line
Line Segment
Polygonal Chain / Curve
Closed / Open Polygonal Chain
Simple Polygon
Jordan Curve Theorem
Jordan Polygon Theorem
Polygon with Holes
Planar Straight-Line Graph (PSLG) or Planar Subdivision
Planar Graphs
Euler Characteristic
Triangulation Theorem
11