You are on page 1of 17

INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

CSN-523: Computational Geometry

Lecture 10: DCEL, Problems with Line Segments

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]
Representing Planar Subdivisions:

2
DCEL:

3
DCEL:

4
DCEL:

5
DCEL:

6
Storing the Polygon as DCEL:

7
Storing the Polygon as DCEL:

8
DCEL:

9
DCEL:

10
DCEL:

11
Problems with Line Segments

12
Two-Segment Intersection:

13
Intersection of Line-Segments:

14
Intersection of Line-Segments:

15
Intersection of Line-Segments:

16
Intersection of Line-Segments:

Assumption: Line segments are in general positions.


No two line segment endpoints or crossings have the same x-
coordinate
No line segment endpoint lies upon another line segment
No three line segments intersect at a single point

Other cases are called as degenerate cases


No line segment is vertical (nasty special case)
If two segments intersect, then they intersect in a single point (that is,
they are not collinear) (nasty special case)

17

You might also like