Computational Geometry Courses and Certifications

Computational Geometry

In this introductory computer science course, explore geometry, develop geometric thinking, and learn geometric algorithms.

• XuetangX
• On-Demand
• Free Online Course

Simons Institute

Recent Progress on Euclidean Spanners

Explore recent advancements in Euclidean spanners, including sparse, light, fault-tolerant, and dynamic variants, while discovering outstanding open problems in the field.

• YouTube
• 36 minutes
• On-Demand
• Free Video

Conference GSI

Convex Hulls of Curves, Volumes, and Signatures

Explore convex hulls of curves, volumes, and signatures in geometry, gaining insights into their mathematical properties and applications.

• YouTube
• 16 minutes
• On-Demand
• Free Video

Coding Train

Weighted Voronoi Stippling Algorithm Implementation - Coding Challenge

Learn to implement weighted Voronoi stippling in p5.js, exploring Delaunay triangulation, Voronoi diagrams, and Lloyd's algorithm to create stunning dot-based images with artistic techniques.

• YouTube
• 29 minutes
• On-Demand
• Free Video

The Julia Programming Language

GeometryOps.jl - Building a Comprehensive Native Geometry Package

Unifying Julia's geometry ecosystem, GeometryOps.jl offers native, high-performance algorithms for spatial data, compatible with GeoInterface.jl and outperforming LibGEOS.jl for implemented operations.

• YouTube
• 11 minutes
• On-Demand
• Free Video

Centre International de Rencontres Mathématiques

Finding Complex Patterns in Trajectory Data via Geometric Set Cover

Explore geometric set cover techniques for analyzing complex trajectory patterns, focusing on mathematical approaches to pattern recognition and data analysis in spatial movement.

• YouTube
• 31 minutes
• On-Demand
• Free Video

media.ccc.de

A Geometry Engine from First Principles - Building CAM Software for 3D Printing

Explore the journey of building a geometry engine for 3D printing from scratch, delving into unique mathematical approaches and innovative algorithms while avoiding existing geometry kernels.

• YouTube
• 46 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Extension Complexity of Random Polytopes

Explores extension complexity of random polytopes, discussing results for fixed-dimension convex hulls of random points on unit sphere or ball. Joint work with Kwan and Zhao.

• YouTube
• 46 minutes
• On-Demand
• Free Video

Paul G. Allen School

Algorithmic Motion Planning Meets Min-Invasive Robotic Surgery

Explores algorithmic motion planning for minimally-invasive surgical robots, focusing on efficient planning methods with provable guarantees to enhance safety and effectiveness in medical procedures.

• YouTube
• 57 minutes
• On-Demand
• Free Video

Applied Algebraic Topology Network

Curvature Variation Based Sampling for Delaunay Triangulations of Manifolds

Explore adaptive sampling for Delaunay triangulations of Riemannian manifolds, focusing on curvature variation and quality bounds for successful triangulation. Learn about geometric realizations and manifold triangulation techniques.

• YouTube
• 50 minutes
• On-Demand
• Free Video

IEEE

Truly Optimal Euclidean Spanners

Explore optimal Euclidean spanners, their construction, and applications in computational geometry and network design. Gain insights from experts Hung Le and Shay Solomon.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Applied Algebraic Topology Network

Reconstructing Manifolds by Weighted L_1-Norm Minimization

Innovative approach to shape reconstruction using weighted l_1-norm minimization, transforming triangulation into a convex optimization problem for smooth orientable manifolds in high-dimensional spaces.

• YouTube
• 51 minutes
• On-Demand
• Free Video

Applied Algebraic Topology Network

Skeletonization Algorithms With Theoretical Guarantees for Point Clouds

Explore skeletonization algorithms for point clouds, including Mapper, alpha-Reeb graphs, and Homologically Persistent Skeleton. Compare their performance on synthetic and real data sets.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Simons Institute

Tight Bounds for Volumetric Spanners in All Norms

Explores optimal bounds for volumetric spanners across all norms, discussing applications in optimization and matrix approximation. Presents a local search method for construction and its implications for coresets in MVEE problems.

• YouTube
• 37 minutes
• On-Demand
• Free Video

计算几何

Dive into fundamental algorithms and theories of computational geometry, from convex hulls and triangulation to Voronoi diagrams and geometric search structures for practical problem-solving.

• XuetangX
• On-Demand
• Free Online Course