00:00:00 / 00:00:00

Lecture 1 - Two-dimensional computational topology

By Jeff Erickson

Appears in collection : School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects

This series of lectures will describe recent and not-so-recent works in computational topology of curves in the plane and on surfaces. Combinatorial and algorithmic aspects will be discussed.

Lecture 1. Historical roots of computational topology - topological invariants, combinatorial encodings, and algorithms - angle sums, rotation numbers, regular homotopy - winding numbers, signed area, point-in-polygon - graphs and Euler tours - Gauss/Dowker code planarity

Information about the video

  • Date of recording 18/06/2018
  • Date of publication 19/06/2018
  • Institution IHP
  • Format MP4

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback