Lecture 3: 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]
Planar Subdivisions:
Planar Subdivisions:
Eulers Triangulation of a Polygon:
How many ways can one subdivides an n-gon into triangles?
Diagonal of polygon P
Triangulation Theorem
Some Basics of Polygons:
Reflex Vertex Convex Polygon Regular Polygon
Constructing Simple Polygon:
Constructing Simple Polygon:
Algorithm Simple Polygon (p1, p2, p3, , pn):
Input: p1, p2, p3, , pn (points in plane) Output: P (a simple polygon whose vertices are p1, p2, p3, , pn in some order) Begin For i=2 to n do Compute the angle alpha_i between the line -p1-pi- and the x-axis (it is sometimes desirable to take an extreme point instead of p1, e.g., a point from the set with the largest x coordinate) Sort the points according to the angles alpha_2, , alpha_n (Break ties according to distances from p1) P is the polygon defined by the list of points in sorted order End