By SecondThread, history, 3 years ago,

# AlgorithmsThread 6: Convex Hulls

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

In it, I talk about:

• 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 :)

• +229

 » 3 years ago, # |   +9 Extremely helpful, please keep going! You're simply great.
 » 3 years ago, # |   +6 Can someone recommend cf problems that use these techniques?
•  » » 3 years ago, # ^ | ← Rev. 3 →   +3 try this easy one.
 » 3 years ago, # |   +1 One of my favourite problems on convex hull trick : Link