Computational Geometry
This channel intents to host videos about Computational Geometry.
Sharath Raghvendra: Sub-Quadratic Exact Algorithms for Geometric k-Disjoint Path Cover
Jonathan Tidor: Semialgebraic graphs and polynomial partitioning
Ben Raichel: The Road to the Closest Point is Paved by Good Neighbors
Zvika Geft: Fully Packed and Ready to Go
Daniel McGinnes: A necessary and sufficient condition for k-transversals
Marc Toussaint: NLP Sampling: A Joint View on Constrained Optimization and Sampling
Mehdi Makhul: Web geometry and orchard problem
Jie Xue: Efficient Approximation Algorithms for Geometric Many-to-Many Matching
Anupam Gupta: Chasing Convex Functions and Bodies
Alexey Garber: On spheres with k points inside
David Eppstein: Non-Euclidean Erdős--Anning Theorems
Steve Simon: Fan distributions via Tverberg’s theorem
Sherry Sarkar: The Online Submodular Assignment Problem
Omrit Filtser: Robustly Guarding Polygons
Mark de Berg: Clique-Based Separators
Sujoy Bhore: Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems
Natan Rubin: An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs
Wolfgang Mulzer: Robust Algorithms for Unit Disk and Transmission Graphs
Michael Hoffmann: Monotone Arc Diagrams with Few Biarcs
David Mount: Differentiable Approximations for Distance Queries
Shakhar Smorodinsky: On geometric versions of Zarankiewicz’s problem
Géza Tóth: The Crossing Lemma for multigraphs
Jeff Phillips: Coresets for Finding Approximate Maximum in a Range Space
Sariel Har-Peled: The Fréchet Distance Unleashed: Approximating a Dog with a Frog
Farouk Harb: Revisiting Random Points: Combinatorial Complexity and Algorithms
Natan Rubin: Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions
Birgit Vogtenhuber: Results on and around Generalized Twisted Drawings of Complete Graphs
Gergely Ambrus: Cube sections, Eulerian numbers and the Laplace-Pólya integral
Martin Suderland: A variant of backwards analysis applicable to order-dependent sets
Sean Dewar: Counting realisations for rigid graphs