11: Algorithmen 2, Vorlesung, WS 2017/18, 27.11.2017 episode artwork

EPISODE · Nov 30, 2017 · 1H 28M

11: Algorithmen 2, Vorlesung, WS 2017/18, 27.11.2017

from Algorithmen 2, Vorlesung, WS17/18 · host Dr. rer. nat. Simon Gog

11 | 0:00:00 Starten 0:06:23 Typische Fragestellungen 0:15:56 Streckenschnitt: Naiver Algorithmus 0:19:04 Idee: Plane-Sweep-Algorithmus 0:24:57 Plane-Sweep für orth. Streckenschnitt 0:29:03 Verallgemeinerung - Grundidee 0:40:56 Verallgemeinerung - Beispiel 0:49:50 Überlappungen finden 0:52:30 2D Konvexe Hülle 0:56:53 Graham's Scan 1:02:07 Kleinste einschließende Kugel 1:19:40 2D Bereichssuche (range research) 1:25:45 Reduktion auf 1..n x 1..n

Episode metadata supplied by the publisher feed · Published Nov 30, 2017

Embed this episode

NOW PLAYING

11: Algorithmen 2, Vorlesung, WS 2017/18, 27.11.2017

0:00 1:28:23

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Algorithmen 2, Vorlesung, WS17/18?

This episode is 1 hour and 28 minutes long.

When was this Algorithmen 2, Vorlesung, WS17/18 episode published?

This episode was published on November 30, 2017.

Can I download this Algorithmen 2, Vorlesung, WS17/18 episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!