Download presentation

Presentation is loading. Please wait.

Published byAbbey Lord Modified over 2 years ago

1
On k-Enclosing Objects in a Coloured Point Set Luis Barba Stephane Durocher Robert Fraser Ferran Hurtado Saeed Mehrabi Debajyoti Mondal Jason Morrison Matthew Skala Mohammad Abdul Wahid Aug 9, 2013 CCCG 2013.........

2
Problem Definition.........

3
Motivation Inspired by problems in string processing (jumbled pattern matching).

4
Motivation Inspired by problems in string processing (jumbled pattern matching). Given a string of characters from some set {1,…,t} and a query c=(c 1,…,c t ), does there exist any contiguous substring that is a permutation of the query? String: 0111001111011110 Query: (1,6)

5
Let’s generalize this to 2D! Most natural (CG) generalization may be to have coloured points enclosed by a rectangle. Wait, wait, wait! Surely this has been done! What has been done?

6
Related Problems Jumbled Pattern Matching - Find a permutation of a query in a string (the 1D version of our problem). k-Enclosing Objects - Find the smallest k- enclosing rectangle/square/disc. – Points are uncoloured. Smallest Colour-Spanning Object - Smallest object containing at least one point of each colour. Subarray Sum - Given a 2D array and a value v, find a subarray whose sum is v.

7
Results

8
The Rectangle Problem...... ……

9
1 st Insight: Break into Strips! Rather than looking at every combination brute force, bound the top and bottom and look at the 1D problem in the strip!............

10
Strips are good............

11
How to do this quickly?............

12
Improvements

13
k-Enclosing Discs Compute the kth order Voronoi diagram. Recall that a cell in the diagram corresponds to the set of points with the same k closest points..........

14
kth Order Voronoi Diagram https://cw.felk.cvut.cz/lib/exe/fetch.php/misc/projects/oppa_oi_english/courses/ae4m39vg/prese ntations/egert-kth_order_voronoi.pdf https://cw.felk.cvut.cz/lib/exe/fetch.php/misc/projects/oppa_oi_english/courses/ae4m39vg/prese ntations/egert-kth_order_voronoi.pdf

15
k-Enclosing Discs.........

16
Results Thanks!

17
k-Enclosing Objects

18
Smallest Colour-Spanning Object

19
Subarray Sum

20
Tweaking the running time

21
Counting the m’s 1 0 2 0 2 1 1 2 5 1 0 3 1 0 6 2 1 0 ≤5? ≥5?

22
k-Enclosing Squares

23
Two-Sided Dominating Regions

24
Smallest Exact Solution For rectangles, no extra time is required. Simply compute the area of the rectangle for any solution found. Discs and squares may be solved with an at most O(k) increase in running time.

Similar presentations

OK

Design and Analysis of Algorithms - Chapter 31 Brute Force A straightforward approach usually based on problem statement and definitions Examples: 1. Computing.

Design and Analysis of Algorithms - Chapter 31 Brute Force A straightforward approach usually based on problem statement and definitions Examples: 1. Computing.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on stress management for students Ppt on indian financial market Ppt on appendicitis and nursing care Free ppt on air conditioner Ppt on applied operations research analyst Ppt on foley catheter Ppt on human nutrition and digestion quiz Ppt on high voltage engineering netherlands Business plan ppt on event management Ppt on equity market in india