{"id":8372,"date":"2018-09-20T13:59:09","date_gmt":"2018-09-20T13:59:09","guid":{"rendered":"http:\/\/blog.bachi.net\/?p=8372"},"modified":"2019-12-15T14:55:15","modified_gmt":"2019-12-15T14:55:15","slug":"tsm_alg","status":"publish","type":"post","link":"https:\/\/blog.bachi.net\/?p=8372","title":{"rendered":"TSM_Alg"},"content":{"rendered":"

Algorithmische Geometrie<\/a>
\nAlgorithmische Geometrie<\/a>, Sommersemester 2014
\nComputational Geometry<\/a>, Summer 2018<\/p>\n

Geometric Algorithms (INFOGA) 2018, Block 2<\/a>, Frank Staals<\/p>\n

Vier Lerntypen<\/h1>\n

Wahrnehmung<\/a>
\nDie vier Lerntypen<\/a>
\nDie vier Lerntypen \u2013 der auditive Lerntyp<\/a>
\nDie vier Lerntypen \u2013 der visuelle Lerntyp<\/a>
\nDie vier Lerntypen \u2013 der haptische Lerntyp<\/a>
\nDie vier Lerntypen \u2013 der kommunikative Lerntyp<\/a><\/p>\n

Erster Teil<\/h1>\n

Algorithmen 1<\/h3>\n

Algorithmen 1, Vorlesung, SS 2019<\/a>, 27.07.2019
\n21: \u00dcbung: Ameisenalgorithmen, Vertex Cover, Nachbarschaftsmetaheuristiken<\/a>, 2.07.2017<\/p>\n

Algorithmen 2<\/h3>\n

Algorithmen 2, Vorlesung, WS2017\/18<\/a>, 08.02.2018
\nAlgorithmen 2, WS 2018\/19<\/a>, 01.08.2019
\n19: Geometrische Algorithmen, Streckenschnitt, \u00dcberlappungen<\/a>, 07.02.2019
\n20: Streckenschnitt, Konvexe H\u00fclle, Geometrische Methoden, \u00dcbung<\/a>, 12.02.2019
\n23: Online Algorithmen, Geometrische Algorithmen, Streckenschnitt<\/a>, 26.01.2017
\n24: Konvexe H\u00fcllen, Bereichssuche, Kleinste einschlie\u00dfende Kugel<\/a>, 26.01.2017
\n25: Wavelet Tree, Sweepline, Linienschnitt, Geometrische Algorithmen<\/a>,01.02.2017<\/p>\n

Das Sweep-Verfahren der algorithmischen Geometrie<\/a>
\nClosest Pair of Points | Divide and Conquer | GeeksforGeeks<\/a>
\nComputational Geometry Lec 4 ( Sweep Line Algorithm ) ( in Arabic )<\/a>
\nComputational Geometry – Line Sweep – 2 – Segments Intersection (Arabic)<\/a>
\nSweep line algorithm part 1<\/a>
\nSweep line algorithm part 2<\/a>
\nCoding Math: Episode 32 – Line Intersections Part I<\/a>
\nCoding Math: Episode 33 – Line Intersections Part II<\/a>
\n11 2 Line Segment Intersection 546<\/a>
\n11 1 1d Range Search 851<\/a>
\n11 3 Kd Trees 2907<\/a>
\n11 4 Interval Search Trees 1347<\/a><\/p>\n

Given n line segments, find if any two segments intersect<\/a>
\nAlgorithmen und Datenstrukturen – Suchbaum<\/a> (PDF)
\nMIT: Introduction to Algorithms – Lecture 24: Geometry<\/a> (PDF)
\nWikipedia – Bin\u00e4rer Suchbaum<\/a><\/p>\n

Point location<\/a>
\nPoint set triangulation<\/a>
\nPlanar straight-line graph<\/a>
\nVoronoi diagram<\/a>
\nVoronoi-Diagramm<\/a>
\nDelaunay triangulation<\/a>
\nDelaunay-Triangulierung<\/a><\/p>\n

<\/p>\n

Woche 1<\/h1>\n
\r\ntime complexity\r\n<\/pre>\n
Analysis of Algorithms: Average Case Analysis<\/a>
\nAnalysis of Algorithms<\/a>
\nAnalysis of Algorithms | Set 1 (Asymptotic Analysis)<\/a>
\nAnalysis of Algorithms | Set 2 (Worst, Average and Best Cases)<\/a>
\nec 1 | MIT 6.046J \/ 18.410J Introduction to Algorithms (SMA 5503), Fall 2005<\/a><\/p>\n
Time complexity: Best and Worst cases | Quick Sort | GateAppliedcourse<\/a>
\nStochastik \u00dcbersicht, Wahrscheinlichkeit, beschreibende\/beurteilende Statistik<\/a>
\nKombinatorik, Permutation mit Wiederholung, Beispiel am Wort Wetter | Mathe by Daniel Jung<\/a>
\nKombinatorik, Permutation, Variation, Kombination, Beispiele, Abz\u00e4hlverfahren | Mathe by Daniel Jung<\/a><\/p>\n
Comparison sorts<\/h3>\n
Simple sorts<\/h4>\n