Overlaying Subdivisions Represented by Doubly Connected Edge Lists
38:49
The Art Gallery Theorem as Solution to the Watchman Problem.
48:28
Partitioning a Polygon into Monotone Pieces by the Line Sweep Method
13:37
Doubly-connected edge lists for planar subdivisions
48:03
Workshop: Introduction to Anoma for App Developers
1:55:27
Worst Fails of the Year | Try Not to Laugh 💩
22:04
The Genius Way Computers Multiply Big Numbers
52:40
Algorithms on Polygons - Computational Geometry
30:29