Distance Geometry (3b1b Summer of Math Exposition 2 скачать в хорошем качестве

Distance Geometry (3b1b Summer of Math Exposition 2

An introduction to distance geometry and to its discretizable subclass of instances Given a simple weighted undirected graph G=(V,E,d), this problem asks whether we can realize G in a Euclidean space with a given dimension, such that the distances between realized vertices u and v of V correspond to the known weight d(u,v), when {u,v} is an edge of E. Sounds complicated? Well, you can find an easy explanation in this video which employs no formulae. The idea behind the discretization of the search space for this problem, and a mention to the applications, is also given. Chapters 2:30 Number of solutions vs discretization 6:18 The Branch and Prune algorithm 10:12 Complexity, applications, and conclusions This video was submitted to the 3b1b Summer of Math Exposition 2 (#SoME2) contest. The contest results were subsequently published in this video: [   • What makes a great math explanation? | SoM...  ] The little girl is Anna. Video by Simon Hengeveld and Antonio Mucherino. Sponsored by ANR multiBioStruct project ANR-19-CE45-0019.