Computer Graphics |
What is computational geometry?
Imagine a convex shaped robot (coloured red) that has to
traverse a surface in a certain general direction (coloured
green) wihout colliding with a convex obstacle (coloured
blue). How can we avoid having to match the two convex
contours every time the robot takes a step?
Let's use Minkowski
sums!