O'Rourke Chapter 7: Search & Intersection in PDF - Computer Science
O'Rourke Chapter 7: Search & Intersection in PDF - Computer Science
O'Rourke Chapter 7: Search & Intersection in PDF - Computer Science
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Intersection</strong> of Segments<br />
• Goal: “Output-size sensitive”<br />
polygon <strong>in</strong>tersection algorithm<br />
• Core Problem: “Output-size<br />
sensitive” l<strong>in</strong>e segment <strong>in</strong>tersection<br />
algorithm<br />
• Bentley-Ottmann plane sweep:<br />
O((n+k)logn) time<br />
• k = number of <strong>in</strong>tersection po<strong>in</strong>ts <strong>in</strong><br />
output<br />
• Intuition: sweep l<strong>in</strong>e (discrete event<br />
ent<br />
simulation)<br />
• First, review algorithm that returns<br />
TRUE iff there exists an <strong>in</strong>tersection
Change language