Mod-04 Lec-07 Convex Hull

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Convex Hull introduces the algorithm for computing the smallest convex polygon containing points. This 53-minute lecture covers multiple algorithmic approaches and complexity analysis.

A 53-minute video from nptelhrd: “Mod-04 Lec-07 Convex Hull”.

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer - Computational Geometry