Circle Packing and Its Applications

Channel:
Microsoft Research
Subscribers:
342,000
Published on ● Video Link: https://www.youtube.com/watch?v=WEmTEE9wjCc


Duration: 1:03:45
4,349 views
34

The Koebe-Andreev-Thurston Circle Packing Theorem lets us draw planar graphs in a canonical way, so that the geometry of the drawing reveals analytic properties of the graph. In this talk, I will review the theory of circle packing and show several applications, old and new, to probability on planar graphs.



Other Videos By Microsoft Research


2016-06-21Computing for Global Development and Resource Constraint
2016-06-21A Software only Mechanism for Device Pass-Through and Sharing
2016-06-21Energy-efficient Scheduling in the Non-clairvoyant Model
2016-06-21F# Type Providers: DBpedia and the Combinator Framework
2016-06-21Arithmetic Circuit Complexity
2016-06-21Approximating ATSP by Relaxing Connectivity
2016-06-21Programming languages and biology
2016-06-21Deep clustering: discriminative embeddings for source separation
2016-06-21Social Computing Symposium 2015: Muse: The Brain Sensing Headband
2016-06-21Advances in Quantum Algorithms and Devices: Welcome and Distributed Denstity Matrices
2016-06-21Circle Packing and Its Applications
2016-06-21Advances in Quantum Algorithms & Devices: Quantum Monte Carlo versus Quantum Adiabatic Optimization
2016-06-21Fast Algorithms for Online Stochastic Convex Programming
2016-06-21Research on Concert Hall Acoustics at Aalto University
2016-06-21Fixed-Energy Harmonic Functions
2016-06-21RDFox — A Modern Materialisation-Based RDF System
2016-06-21Competitive erosion is conformally invariant
2016-06-21A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem
2016-06-21Recent Advances in Deep Learning at Microsoft: A Selected Overview
2016-06-21The Interplay of Social Influence and Own Preference in Social Networks
2016-06-21A Fast Distributed Algorithm for α-Fair Packing Problems


Tags:
microsoft research
algorithms