1 / 44

Efficient Point Separation Algorithm

Learn about the Divide and Conquer approach to analyzing algorithms for separating points efficiently. Understand how to distinguish red and blue points in minimal time by implementing the discussed strategies.

lou
Download Presentation

Efficient Point Separation Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Divide-and-ConquerReading: CLRS Sections 2.3, 4.1, 4.2, 4.3, 28.2, 33.4. CSE 780 Analysis of Algorithms Steve Lai

  2. L1 L0 L2 Red points are apart by at least δ k δ δ For k, only need to consider the points in the square less the right and bottom edges Blue points are apart by at least δ

More Related