IntLP - CSE 4101/5101 Line Segments Intersections Prof....

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSE 4101/5101 Line Segments Intersections Prof. Andy Mirzaian Line Segments Intersections Thematic Map Overlay Photos courtesy of ScienceGL 2 References: • [CLRS] chapter 33 • [M. de Berge et al ’00] chapter 2 • [Preparata-Shamos’85] chapter 7 • [O’Rourke’98] chapter 7 Applications : • Graphics: hidden line/surface removal • GIS: Geographic Information Systems • Cartography • VLSI circuit layout • Pattern recognition • Optimization: Linear Programming • Arrangement of lines, planes, hyper-planes • Visibility, kernels, etc. 3 Line Segments Intersection Problem Given a set L={ l1,l2, … , ln } of n line segments in the plane, report all pair-wise intersections in L. (Modes: reporting, counting or disjointness.) • Naïve approach : check every pair in L in O(n2) time. • Can we make this output sensitive? • Suppose there are a total of R intersecting pairs to report, where 0 R (n2). Ø O(R + n log n) time is achievable for reporting mode. Ø O(n log n) time for counting & disjointness mode. 4 Sp eci al Case: rectilinear L Assume segments in L are vertical (blue) or horizontal (red) , and each intersection is between a red-blue pair. e.g., in VLSI 5 Sp eci al Case: rectilinear L Assume segments in L are vertical (blue) or horizontal (red) , and each intersection is between a red-blue pair. Plane Sweep Method : vertical sweep-line moving left-to-right. • Active segments: horizontal segments that intersect the sweep-line. • Sweep event schedule: x-sorted segment endpoints ( 2 per red, 1 per blue ). • Sweep Status: y-ordering of the active horizontal segments maintained in an efficient dictionary D. Sweep-line b a c d e b a d D 6 Sp eci al Case: rectilinear L Assume segments in L are vertical (blue) or horizontal (red) , and each intersection is between a red-blue pair. Plane Sweep Method : vertical sweep-line moving left-to-right. • Active segments: horizontal segments that intersect the sweep-line. • Sweep event schedule: x-sorted segment endpoints ( 2 per red, 1 per blue ). • Sweep Status: y-ordering of the active horizontal segments maintained in an efficient dictionary D. Sweep-line b a c d e b a d c D 7 Sp eci al Case: rectilinear L Assume segments in L are vertical (blue) or horizontal (red) , and each intersection is between a red-blue pair. Plane Sweep Method : vertical sweep-line moving left-to-right. • Active segments: horizontal segments that intersect the sweep-line. • Sweep event schedule: x-sorted segment endpoints ( 2 per red, 1 per blue ). • Sweep Status: y-ordering of the active horizontal segments maintained in an efficient dictionary D. Sweep-line b a c d e b a d c D e1 e2 e1 e2 8 Sp eci al Case: rectilinear L Assume segments in L are vertical (blue) or horizontal (red) , and each intersection is between a red-blue pair....
View Full Document

This note was uploaded on 02/13/2012 for the course CSE 4101 taught by Professor Mirzaian during the Winter '12 term at York University.

Page1 / 38

IntLP - CSE 4101/5101 Line Segments Intersections Prof....

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online