SecondThread's blog

AlgorithmsThread Episode 6: Convex Hull Tricks
By SecondThread, history, 4 years ago, In English

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

  • Vote: I like it
  • +229
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +9 Vote: I do not like it

Extremely helpful, please keep going! You're simply great.

→ Reply
»
4 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Can someone recommend cf problems that use these techniques?

→ Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

One of my favourite problems on convex hull trick : Link

→ Reply