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.
Planar Po<strong>in</strong>t Location<br />
source: O’Rourke<br />
• Goal: Given a planar subdivision of n<br />
vertices, preprocess it so that po<strong>in</strong>t location<br />
query can be quickly answered.<br />
• A polygonal planar subdivision can be<br />
preprocessed <strong>in</strong> O(n) time and space for<br />
O(log n) query.<br />
• 2D version/variant of <strong>in</strong>dependent set/nested<br />
approach ( may need to triangulate polygonal faces)<br />
• Monotone subdivision approach*<br />
• Randomized dtrapezoidal decomposition*<br />
i * See next slides.
Change language