Skip to content

Mod-01 Lec-02 Visibility Problems

nptelhrd2.25M subscribers

About this video

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

Visibility Problems covers algorithms for determining which geometric objects can see each other. This 52-minute lecture explains line-of-sight computation and visibility graph construction.

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

Part of Computer - Computational Geometry