Download presentation

Presentation is loading. Please wait.

1
Daoqi Wang Problem 41 from Open Problems Project

2
Sorting X + Y where X + Y = {x + y | x ∈ X, y ∈ Y} (Minkowski sum) Ex: X = {1, 2, 3}, Y = {4, 5, 6} {5, 6, 6, 7, 7, 7, 8, 8, 9} X1X1 X2X2 X3X3 Y1Y Y2Y Y3Y

3
Michael Fredman, 1976 Algorithm found by William Steiger and Ileana Streinu in 1995 with O(n^2logn) running time with O(n^2) comparisons Question: is it o(n^2logn)?

4
Antonio Herrera, 1996 ◦ Presented problems that are at least as hard as sorting X + Y ◦ Tracing the intersections of a ray ◦ Enumerating distances (K shortest distances) O(nlogn + klogn)

5
Timothy Chan, 2006 ◦ Necklace alignment (L 1, L 2, L ∞ )

6
Timothy Chan, 2006 ◦ Convolution (max, min, range)

7
Status ◦ Open ◦ o(n^2logn) Importance ◦ 3SUM(a + b + c = 0) ◦ Topological Sorting ◦ Sperm Sorting

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google