47:38A Lovász-Kneser Theorem for Triangulations
A 48-minute video from Computational Geometry: “A Lovász-Kneser Theorem for Triangulations”.
Computational Geometry
883 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
47:38
55:41Abdul Basit: Zarankiewicz’s problem for semilinear hypergraphs
A 56-minute video from Computational Geometry: “Abdul Basit: Zarankiewicz’s problem for semilinear hypergraphs”.
52:37Alex Cohen: Tiny triangles and fractal geometry
A 53-minute video from Computational Geometry: “Alex Cohen: Tiny triangles and fractal geometry”.
49:15Alex Iosevich: On distance sets and complexity
A 49-minute video from Computational Geometry: “Alex Iosevich: On distance sets and complexity”.
42:00Alex Steiger: Decomposing the complement of the union of cubes
A 42-minute video from Computational Geometry: “Alex Steiger: Decomposing the complement of the union of cubes”.
55:49Alexander Wolff: Coloring Mixed Interval Graphs
A 56-minute video from Computational Geometry: “Alexander Wolff: Coloring Mixed Interval Graphs”.
49:38Alexey Garber: On spheres with k points inside
A 50-minute video from Computational Geometry: “Alexey Garber: On spheres with k points inside”.
44:27Andrew Suk: Short edges in topological graphs
A 44-minute video from Computational Geometry: “Andrew Suk: Short edges in topological graphs”.
48:31Anna Lubiw: The visibility center of a polygon
A 49-minute video from Computational Geometry: “Anna Lubiw: The visibility center of a polygon”.
45:30Anne Driemmel: Data Structures for Proximity Searching under the Fréchet Distance
A 46-minute video from Computational Geometry: “Anne Driemmel: Data Structures for Proximity Searching under the Fréchet Distance”.
1:01:44Anupam Gupta: Chasing Convex Functions and Bodies
A 62-minute video from Computational Geometry: “Anupam Gupta: Chasing Convex Functions and Bodies”.
47:55Anurag Bishnoi: Grid Covering Problems (NYU CG Seminar, 9/12/23)
A 48-minute video from Computational Geometry: “Anurag Bishnoi: Grid Covering Problems (NYU CG Seminar, 9/12/23)”.
52:33Audie Warren: Non-linear incidence bounds over finite fields
A 53-minute video from Computational Geometry: “Audie Warren: Non-linear incidence bounds over finite fields”.
1:03:20Ben Raichel: The Road to the Closest Point is Paved by Good Neighbors
A 63-minute video from Computational Geometry: “Ben Raichel: The Road to the Closest Point is Paved by Good Neighbors”.
1:02:27Birgit Vogtenhuber: Results on and around Generalized Twisted Drawings of Complete Graphs
A 62-minute video from Computational Geometry: “Birgit Vogtenhuber: Results on and around Generalized Twisted Drawings of Complete Graphs”.
58:14Carola Wenk: Comparing Embedded and Immersed Graphs
A 58-minute video from Computational Geometry: “Carola Wenk: Comparing Embedded and Immersed Graphs”.
56:23Chris Bishop: Optimal triangulation of polygons
A 56-minute video from Computational Geometry: “Chris Bishop: Optimal triangulation of polygons”.
52:58Christiane Schmidt: k*-Transmitter Watchman Routes (and Some Guarding Problems
A 53-minute video from Computational Geometry: “Christiane Schmidt: k*-Transmitter Watchman Routes (and Some Guarding Problems”.
58:33Cosmin Pohoata: Convex Polytopes from Fewer Points
A 59-minute video from Computational Geometry: “Cosmin Pohoata: Convex Polytopes from Fewer Points”.
27:13DCG Day 2022.1. Andreas Holmsen: An allowable feast
A 27-minute video from Computational Geometry: “DCG Day 2022.1. Andreas Holmsen: An allowable feast”.
29:10DCG Day 2022.2. Micha Sharir: Polynomial partitioning: The hammer and some (recent alg.) nails
A 29-minute video from Computational Geometry: “DCG Day 2022.2. Micha Sharir: Polynomial partitioning: The hammer and some (recent alg.) nails”.
36:41DCG Day 2022.3. Esther Ezra: Recent developments on intersection searching
A 37-minute video from Computational Geometry: “DCG Day 2022.3. Esther Ezra: Recent developments on intersection searching”.
28:15DCG Day 2022.4. Xavier Goaoc: Some questions on order types
A 28-minute video from Computational Geometry: “DCG Day 2022.4. Xavier Goaoc: Some questions on order types”.
30:59DCG Day 2022.5. Andrew Suk: Unavoidable patterns in simple topological graphs
A 31-minute video from Computational Geometry: “DCG Day 2022.5. Andrew Suk: Unavoidable patterns in simple topological graphs”.
39:21DCG Day 2022.6. Sylvain Cappell: Mesh matrices of graphs, of simplicial complexes and matroids ...
A 39-minute video from Computational Geometry: “DCG Day 2022.6. Sylvain Cappell: Mesh matrices of graphs, of simplicial complexes and matroids ...”.
52:28Daniel McGinnes: A necessary and sufficient condition for k-transversals
A 52-minute video from Computational Geometry: “Daniel McGinnes: A necessary and sufficient condition for k-transversals”.
48:31David Eppstein: Finding Relevant Points for Nearest-Neighbor Classification
A 49-minute video from Computational Geometry: “David Eppstein: Finding Relevant Points for Nearest-Neighbor Classification”.
50:25David Eppstein: Non-Euclidean Erdős--Anning Theorems
A 50-minute video from Computational Geometry: “David Eppstein: Non-Euclidean Erdős--Anning Theorems”.
48:35David Mount: Differentiable Approximations for Distance Queries
A 49-minute video from Computational Geometry: “David Mount: Differentiable Approximations for Distance Queries”.
46:55Dominique Attali: Reconstructing manifolds by weighted ℓ1-norm minimization
A 47-minute video from Computational Geometry: “Dominique Attali: Reconstructing manifolds by weighted ℓ1-norm minimization”.
41:55Dror Dayan: Near-Optimal Multi-Robot Motion Planning with Finite Sampling
A 42-minute video from Computational Geometry: “Dror Dayan: Near-Optimal Multi-Robot Motion Planning with Finite Sampling”.
1:00:26Elon Rimon: Configuration space perspectives on minimalistic robot hands
A 60-minute video from Computational Geometry: “Elon Rimon: Configuration space perspectives on minimalistic robot hands”.
54:44Emo Welzl: Triangulation Flip Graphs of Planar Point Sets
A 55-minute video from Computational Geometry: “Emo Welzl: Triangulation Flip Graphs of Planar Point Sets”.
54:39Erin Wolf Chambers: Applications of Topology and Geometry to Root Analysis
A 55-minute video from Computational Geometry: “Erin Wolf Chambers: Applications of Topology and Geometry to Root Analysis”.
58:50Erin Wolf Chambers: Computing optimal homotopies
A 59-minute video from Computational Geometry: “Erin Wolf Chambers: Computing optimal homotopies”.
1:05:18Esther Ezra: Arc-Intersection Queries Amid Triangles in Three Dimensions and Related Problems
A 65-minute video from Computational Geometry: “Esther Ezra: Arc-Intersection Queries Amid Triangles in Three Dimensions and Related Problems”.