We'd love your feedback! Please take a minute to share your thoughts.

Summer of Math Exposition

How to Cross a Field of Cows… Safely (using Math) #SoME4

Audience: undergraduategraduate

Tags: computer-sciencecomputational-complexitynumerical-methodsoptimization-problemmathematical-problem

How would you cross a field full of cows at minimal risk 🐄? And what is the quickest way to calculate the best path? This video explores three mathematical approaches and their runtime performance: From expressing danger with a cost function, to using a Voronoi diagram, to a combo of the Depth-first search (DFS) and Union-Find algorithms for building the safest path.



Analytics

7 Overall score*
24 Rank
14 Votes
9 Comments

Comments

7.4

The visuals are outstanding - I especially liked the point about reflecting the simulation field to generate boundary nodes for the Voronoi diagram

7

The beginning story and cartoon is cute and an excellent way to motivate the problem. The solutions are well visualized. For viewers who don’t know these algorithms, it might be hard to follow. It might have helped to show some intermediate states of how Voronoi diagrams are built or how Dijkstra’s algorithm calculates the shortest path.

7

This started a little slow and I didn’t think I was going to care about the problem — but it absolutely drew me in. There were a couple of steps I didn’t quite follow, but nothing that broke the flow of the argument. The art at the start was a lovely touch (and I’m glad we got to see Rumo at the end). I felt like the Ackermann section was a little unmotivated — does it matter how fast union-find is when it clearly produces bad output — but I’m glad the union-find section was included and overall I really enjoyed this

8

Great Job!

6.5

A quite unique style at the start, good explanations and an interesting problem

7.3

Well organized with good visuals. It would have been nice to delve into the order operations and explain the computational time a little more, but that’s likely not a global opinion.

6.3

A neat video. I think it works best if you view it as a list of demonstration problems for algorithmic complexity — as you said yourself, it is not entirely obvious where you would use it in real life. Still, the complexity analysis felt a bit rushed to me, so I don’t really see where the focus is meant to be here. I liked how your last algorithm provides a qualitatively different answer, though it also looks the most naive. A content note: I don’t think you addressed how in the first algorithm, diagonal paths have a bit of an unfair advantage because you get penalised for only one danger evaluation while you cross 2\sqrt{2} meters. Might have just missed it. Some of the larger images likely don’t work well on mobile. I think the pacing could be faster in general and the presentation a bit more vivid on a graphical level. Your concrete example of the cow meadow gets quite sterile after the intro and could have lent itself to a more memorable presentation, though that is just a suggestion.

7.7

Loved how a thought experiment can result in different kinds of solutions. Beautifully demonstrated graph concepts as well.

6.5

fun visuals, not entirely explained well, and not very memorable. Interesting premise though in principle. passable.