AlgorithmsThread Episode 6: Convex Hull Tricks

Revision en1, by SecondThread, 2020-07-07 22:20:20

Hi everyone! I just released Episode 6 of AlgorithmsThread (now rebranded from Algorithms Dead after frodakcin's epic suggestion).

• Getting the convex hull
• Checking if a point is in a convex hull in $O(log(n))$
• Finding the farthest point in some direction in $O(log(n))$
• The problem Trash Removal with $O(n^3)$ -> $O(n^2)$ -> $O(n*log(n))$ solutions
• The more difficult problem Troop Mobilization from ICPC South East Regionals

I hope you enjoy. Feel free to ask questions below, as usual :)

History

Revisions

Rev. Lang. By When Δ Comment
en1 SecondThread 2020-07-07 22:20:20 690 Initial revision (published)